Efficient Edge Domination on Hole-Free Graphs in Polynomial Time.

Andreas Brandstädt Christian Hundt Ragnar Nevries

Published in: LATIN (2010)

Keyphrases

special case
np complete
polynomial time complexity
neural network
computational complexity
edge detection
undirected graph
graph isomorphism
computationally efficient
structured data
directed graph
edge information
graph representation
graph theoretic