论文信息 - Recognizing quasi-triangulated graphs

Recognizing quasi-triangulated graphs

This paper discusses a method for recognizing certain graph classes based on elimination schemes more efficiently. We reduce the time bound for recognizing quasi-triangulated graphs from O(n^3) to O(n^2^.^7^7), and perfect elimination bipartite and cop-win graphs from O(n^3) to O(n^3/logn).

Jeremy P. Spinrad | J. Spinrad

[1] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .

[2] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[3] Victor Y. Pan,et al. Fast Rectangular Matrix Multiplication and Applications , 1998, J. Complex..

[4] V. Chvátal. Perfectly Ordered Graphs , 1984 .

[5] Volker Weispfenning,et al. Non-Commutative Gröbner Bases in Algebras of Solvable Type , 1990, J. Symb. Comput..

[6] Peter Winkler,et al. Vertex-to-vertex pursuit in a graph , 1983, Discret. Math..

[7] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.

[8] Robert E. Tarjan,et al. A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..

[9] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[10] Bruce A. Reed,et al. Some classes of perfectly orderable graphs , 1989, J. Graph Theory.

[11] Chính T. Hoàng,et al. A note on perfect orders , 1989, Discret. Math..

[12] Matthias MIDDENDORF,et al. On the complexity of recognizing perfectly orderable graphs , 1990, Discret. Math..

[13] Dominique de Werra,et al. Four classes of perfectly orderable graphs , 1987, J. Graph Theory.

[14] Doron Rotem,et al. Recognition of Perfect Elimination Bipartite Graphs , 1982, Inf. Process. Lett..