Title of article
Computational complexity of edge modification problems in different classes of graphs
Author/Authors
Burzyn، نويسنده , , Pablo and Bonomo، نويسنده , , Flavia and Durلn، نويسنده , , Guillermo، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
6
From page
41
To page
46
Abstract
Edge modification problems in graphs have a lot of applications in different areas. Polynomial time algorithms and NP-completeness results appear in several works in the literature. In this paper, we prove new complexity results of these problems in some graph classes, such as, interval, circular-arc, permutation, circle, bridge and weakly chordal graphs.
Keywords
edge modification problems , computational complexity , graph classes
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2004
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453750
Link To Document