Polygon graph recognition

Journal of Algorithms

Volumn 26, Issue 1, 1998, Pages 101-140

  Elmallah, E S ^a   Stewart, L K ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011511953     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0883     Document Type: Article

References (16)

1. A. Bouchet, Reducing prime graphs and recognizing circle graphs, Combinatorica 7 (1987), 243-254.
2. W. H. Cunningham, Decomposition of directed graphs, SIAM J. Algebraic Discrete Methods 3 (1982), 214-228.
3. W. H. Cunningham and J. Edmonds, A combinatorial decomposition theory, Canad. J. Math. 22 (1980), 734-765.
4. R. G. Downey and M. R. Fellows, Fized-parameter tractability and completeness , I: Basic results, SIAM J. Comput. 24 (1995), 873-921.
5. E. S. Elmallah, Algorithms for k-terminal reliability problems with node failures, Networks 22 (1992), 369-384.
6. E. S. Elmallah and L. K. Stewart, Domination in polygon graphs, in "Proceedings of the 21st Southeastern Conference on Combinatorics, Graph Theory and Computing, 1990," pp. 63-76.
7. E. S. Elmallah and L. K. Stewart, Independence and domination in polygon graphs, Discrete Appl. Math. 44 (1993), 65-77.
8. S. Even, A. Pnueli, and A. Lempel, Permutation graphs and transitive graphs, J. Assoc. Comput. Mach. 19 (1972), 400-410.
9. C. P. Gabor, K. J. Supowit, and W.-L. Hsu, Recognizing circle graphs in polynomial time, J. Assoc. Comput. Mach. 36 (1989), 435-473.
10. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-completeness," Freeman, San Francisco, 1979.
11. M. C. Golumbic, "Algorithmic Graph Theory and Perfect Graphs," Academic Press, New York, 1980.
12. D. Kratsch and L. Stewart, Total domination and transformation, Inform. Process. Lett., to appear.
13. 2) algorithm for the undirected split decomposition, J. Algorithms 16 (1994), 145-160.
14. R. M. McConnell and J. P. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, in "Proceedings of the Fifth Annual ACM-SIAM Symposium of Discrete Algorithms, 1994," pp. 536-545, ACM, New York, 1994.
15. W. Naji, Reconnaissance des graphes de cordes, Discrete Math. 54 (1985), 329-337.
16. J. Spinrad, Recognition of circle graphs, J. Algorithms 16 (1994), 264-282.