Login / Signup
Computational complexity of edge modification problems in different classes of graphs.
Pablo Burzyn
Flavia Bonomo
Guillermo Durán
Published in:
Electron. Notes Discret. Math. (2004)
Keyphrases
</>
computational complexity
np complete
weighted graph
pairwise
special case
tractable cases
lower bound
graph structure
edge information
graph representation