Hole and Antihole Detection in Graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 843-852

  Nikolopoulos, Stavros D ^a   Palios, Leonidas ^a  

^a UNIVERSITY OF IOANNINA   (Greece)

Author keywords

Antihole; Co connectivity; Hole; Weakly chordal graph

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; ERROR ANALYSIS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

ANTIHOLE; CO-CONNECTIVITY; HOLE; WEAKLY CHORDAL GRAPH;

COMPUTER SCIENCE;

EID: 1842434565     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. C. Berge, Farbung von Graphen deren samtliche bzw. deren ungerade Kreise starr sind, Wiss. Zeitschrift, Mathematisch-Naturwissenschaftliche Reihe, Martin-Luther-Univ. Halle-Wittenberg, 114-115, 1961.
2. A. Berry, J.-P. Bordat, and P. Heggernes, Recognizing weakly triangulated graphs by edge separability, Nordic J. Computing 7, 164-177, 2000.
3. K.W. Chong, S.D. Nikolopoulos, and L. Palios, An optimal parallel co-connectivity algorithm, Theory of Computing Systems (to appear); Technical Report 27-02, Dept of Computer Science, Univ. of Ioannina, 2002.
4. K.W. Chong, S.D. Nikolopoulos, and L. Palios, An optimal parallel co-connectivity algorithm, Theory of Computing Systems (to appear); Technical Report 27-02, Dept of Computer Science, Univ. of Ioannina, 2002.
5. M. Chudnovsky, N. Robertson, P.D. Seymour, and R. Thomas, The strong perfect graph theorem, preprint, 2002.
6. M. Chudnovsky and P.D. Seymour, Recognition algorithm for Berge graphs, preprint, 2003.
7. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms (2nd edition), MIT Press, Inc., 2001.
8. G. Cornuéjols, X. Liu, and K. Vušković, Perfect graph recognition, Proc. 44th IEEE Symp. on Foundations of Computer Science (FOCS 2003), 2003.
9. E. Dahlhaus, J. Gustedt, and R.M. McConnell, E - cient and practical algorithms for sequential modular decomposition, J. Algorithms 41, 360-387, 2001.
10. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
11. R.B. Hayward, Weakly triangulated graphs, J. Comb. Theory Ser. B 89, 200-208, 1985.
12. R.B. Hayward, Two classes of perfect graphs, PhD Thesis, School of Computer Science, McGill Univ., 1987.
13. R.B, Hayward, J. Spinrad, and R. Sritharan, Weakly chordal graph algorithms via handles, Proc. 11th ACM-SIAM Symp. on Discrete Algorithms (SODA 2000), 42-49, 2000.
14. H. Ito and M. Yokoyama, Linear time algorithms for graph search and connectivity determination on complement graphs, Inform. Process. Letters 66, 209-213, 1998.
15. 4-com-parability graphs, Proc. 28th Int. Workshop on Graph Theoretic Aspects of Computer Science (WG 2002), 355-366, 2002.
16. D.J. Rose, R.E. Tarjan, and G.S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Computing 5, 266-283, 1976.
17. J.P. Spinrad, Finding large holes, Inform. Process. Letters 39, 227-229, 1991.
18. J.P. Spinrad and R. Sritharan, Algorithms for weakly triangulated graphs, Discrete Applied Math. 59, 181-191, 1995.
19. R.E. Tarjan and M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Computing 13, 566-579, 1984.