Recognizing quasi-triangulated graphs

Discrete Applied Mathematics

Volumn 138, Issue 1-2, 2004, Pages 203-213

  Spinrad, Jeremy P ^a  

^a VANDERBILT UNIVERSITY   (United States)

Author keywords

Cop win graphs; Good graphs; Perfect elimination bipartite graphs; Quasi triangulated graphs

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; NUMERICAL METHODS; POLYNOMIALS; SET THEORY;

COP-WIN GRAPHS; GOOD GRAPHS; PERFECT ELIMINATION BIPARTITE GRAPHS; QUASI-TRIANGULATED GRAPHS;

GRAPH THEORY;

EID: 1242332308     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00295-6     Document Type: Conference Paper

References (14)

1. Arlazarov V.L., Dinic E.A., Kronrod M.A., Faradzev I.A. The economical construction of the transitive closure of an oriented graph. Dokl. Akad. Nauk SSSR. 194:1970;487-488.
2. Brandstädt A., Le V.B., Spinrad J. Graph classes: a survey. 1999;SIAM, Philadelphia.
3. V. Chvátal, Perfectly ordered graphs, in: C. Berge, V. Chvátal (Eds.), North-Holland, Amsterdam, Topics on Perfect Graphs, Ann. Discrete Math. vol. 21. 1984, pp. 327-333.
4. Coppersmith D., Winograd S. Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9:1990;1-6.
5. Gabow H., Tarjan R.E. A linear time algorithm for a special case of disjoint set union. J. Comput. System Sci. 30:1985;209-221.
6. Goh L., Rotem D. Recognition of perfect elimination bipartite graphs. Inform. Process. Lett. 15:1982;179-182.
7. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
8. I.M. Gorgos, Characterization of quasitriangulated graphs, Technical Report, University of Kishinev, 1982.
9. C.T. Hoàng, personal communication, 2000.
10. Hoàng C.T., Mahadev N.V.R. A note on perfect orders. Discrete Math. 74:1989;77-84.
11. Hoàng C.T., Reed B.A. Some classes of perfectly orderable graphs. J. Graph Theory. 13:1989;445-463.
12. Huang X., Pan V.Y. Fast rectangular matrix multiplication and its applications. J. Complexity. 14:1998;257-299.
13. Middendorf M., Pfeiffer F. On the complexity of recognizing perfectly orderable graphs. Discrete Math. 80:1990.
14. Nowakowski R., Winkler P. Vertex-to-vertex pursuit in a graph. Discrete Math. 43:1983;235-239.