Computational complexity of edge modification problems in different classes of graphs

Electronic Notes in Discrete Mathematics

Volumn 18, Issue , 2004, Pages 41-46

  Burzyn, Pablo ^a   Bonomo, Flavia ^a   Durán, Guillermo ^b  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b DEPARTAMENTO DE FÍSICA   (Chile)

Author keywords

computational complexity; edge modification problems; graph classes

Indexed keywords

EID: 33745858138     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2004.06.007     Document Type: Article

References (25)

1. Bodlaender H., and De Fluiter B. On intervalizing k-colored graphs for DNA physical mapping. Disc. App. Math. 71 (1966) 55-77
2. Booth K., and Lueker G. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comp. Sci. 13 (1976) 335-379
3. Brandstädt A., Le V., and Spinrad J. Graph Classes: A Survey (1999), SIAM
4. G. Durán, A. Gravano, J. Spinrad, A. Tucker, Polynomial time recognition of unit-circular arc graphs, submitted
5. Dushnik B., and Miller E. Partially ordered sets. Amer. J. Math. 63 (1941) 600-610
6. El-Mallah E., and Colbourn C. The complexity of some edge deletion problems. IEEE Trans. Circ. Syst. 35 3 (1988) 354-362
7. Farber M., and Jamison R. On local convexity in graphs. Disc. Math. 66 (1987) 231-247
8. Garey M., and Jonhson D. Computers and Intractability: A Guide to the Theory of NP- Completeness (1979), Freeman and Co.
9. Garey M., Johnson D., and Stockmeyer L. Some simplified NP-complete graph problems. Theor. Comp. Sci. 1 (1976) 237-267
10. Garey M., Johnson D., and Tarjan R. The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comp. 5 (1976) 704-714
11. Goldberg P., Golumbic M., Kaplan H., and Shamir R. Four strikes against physical mapping of DNA. J. Comp. Biol. 2 (1995) 139-152
12. Golumbic M. Algorithmic Graph Theory and Perfect Graphs (1980), Acad. Press
13. Golumbic M., Kaplan H., and Shamir R. On the complexity of DNA physical mapping. Advances in App. Math. 15 (1994) 251-261
14. Hakimi S., Schmeichel E., and Young N. Orienting graphs to optimize reachability. Inform. Proc. Letters 63 (1997) 229-235
15. Hammer P., and Simeone B. The splittance of a graph. Combinatorica 1 (1981) 275-284
16. Margot F. Some complexity results about threshold graphs. Disc. App. Math. 49 (1994) 229-308
17. McConnell R., and Spinrad J. Linear-time transitive orientation. Proc. 8th Ann. ACM-SIAM Symp. on Disc. Algorithms, New Orleans (1997) 19-25
18. Natanzon A., Shamir R., and Sharan R. Complexity classification of some edge modifications problems. Disc. App. Math. 113 (2001) 109-128
19. Rose J. A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. In: Reed R.C. (Ed). Graph Theory and Computing (1972), Acad. Press 183-217
20. R. Sharan, Graph Modification Problems and their Applications to Genomic Research, Phd. Thesis, Tel-Aviv University (2002)
21. Spinrad J. Recognition of circle graphs. J. of Algorithms 16 2 (1994) 264-282
22. Spinrad J., and Sritharan R. Algorithms for weakly triangulated graphs. Disc. App. Math. 59 (1995) 181-191
23. Tucker A. Matrix characterizations of circular-arc graphs. Pacific J. Math. 38 (1971) 535-545
24. Yannakakis M. Computing the minimum fill-in is NP-complete. SIAM J. Alg. Disc. Math. 2 1 (1981) 77-79
25. Yannakakis M. Edge deletion problems. SIAM J. Comp. 10 2 (1981) 297-309