Vertex disjoint paths on clique-width bounded graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2976, Issue , 2004, Pages 119-128

  Gurski, Frank ^a   Wanke, Egon ^a  

^a Department of Computer Science ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; TREES (MATHEMATICS);

CLIQUE-WIDTH; CO-GRAPHS; GRAPH PROBLEMS; LINEAR TIME; NLC-WIDTH; NP COMPLETE; TREE-WIDTH; VERTEX DISJOINT PATHS;

GRAPH THEORY;

EID: 32544454453     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24698-5_16     Document Type: Article

References (24)

1. [AGKR02] S. Alstrup, G. Gavoille, H. Kaplan, and T. Rauhe. Nearest common ancestors: A survey and a new distributed algorithm. In Proceedings of the Annual ACM Symposium on Parallel Algorithms and Architectures, pages 258-264. ACM, 2002.
2. [BDLM02] A. Brandstädt, F. F. Dragan, H.-O. Le, and R. Mosca. New graph classes of bounded clique width. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 2573 of LNCS, pages 57-67. Springer-Verlag, 2002.
3. [Bod90] H.L. Bodlaender. Polynomial algorithms for chromatic index and graph isomorphism on partial fc-trees. Journal of Algorithms, 11(4):631-643, 1990.
4. +00] D.G. Corneil, M. Habib, J.M. Lanlignel, B. Reed, and U. Roties. Polynomial time recognition of clique-width at most three graphs. In Proceedings of Latin American Symposium on Theoretical Informatics (LATIN '2000), volume 1776 of LNCS. Springer-Verlag, 2000.
5. [CMR00] B. Courcelle, J.A. Makowsky, and U. Roties. Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems, 33(2): 125-150, 2000.
6. [CO00] B. Courcelle and S. Olariu. Upper bounds to the clique width of graphs. Discrete Applied Mathematics, 101:77-114, 2000.
7. [CPS85] D.G. Cornell, Y. Perl, and L.K. Stewart. A linear recognition algorithm for cographs. SIAM Journal on Computing, 14(4):926-934, 1985.
8. [CR01] D.G. Cornell and U. Roties. On the relationship between clique-width and treewidth. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 2204 of LNCS, pages 78-90. Springer-Verlag, 2001.
9. [EGW01] W. Espelage, F. Gurski, and E. Wanke. How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 2204 of LNCS, pages 117-128. Springer-Verlag, 2001.
10. [EGW03] W. Espelage, F. Gurski, and E. Wanke. Deciding clique-width for graphs of bounded tree-width. Journal of Graph Algorithms and Applications - Special Issue of JGAA on WADS 2001, 7(2):141-180, 2003.
11. [EIS76] S. Even, A. Itai, and A. Shamir. On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing, 5:691-703, 1976.
12. [FM91] T. Feder and R. Motwani. Clique partitions, graph compression and speeding up algorithms. In Proceedings of the Annual ACM Symposium on Theory of Computing, pages 123-133. ACM, 1991.
13. [GR99] M.C. Golumbic and U. Roties. On the clique-width of some perfect graph classes. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 1665 of LNCS, pages 135-147. Springer-Verlag, 1999.
14. [GW00] F. Gurski and E. Wanke. The tree-width of clique-width bounded graphs without Kn,n- In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 1938 of LNCS, pages 196-205. Springer-Verlag, 2000.
15. [Joh98] O. Johansson. Clique-decomposition, NLC-decomposition, and modular decomposition - relationships and results for random graphs. Congressus Numerantium, 132:39-60, 1998.
16. [JohOO] O. Johansson. NLC2-decomposition in polynomial time. International Journal of Foundations of Computer Science, 11(3):373-395, 2000.
17. [KR01] D. Kobler and U. Roties. Polynomial algorithms for partitioning problems on graphs with fixed clique-width. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 468-476. ACM-SIAM, 2001.
18. [MP95] M. Middendorf and F. Pfeiffer. On the complexity of the disjoint paths problems. Combinatorica, 35(1):97-107, 1995.
19. [NVZ01] T. Nishizeki, J. Vygen, and X. Zhou. The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discrete Applied Mathematics, 115:177-186, 2001.
20. [RS86] N. Robertson and P.D. Seymour. Graph minors II. Algorithmic aspects of tree width. Journal of Algorithms, 7:309-322, 1986.
21. [RS95] N. Robertson and P.D. Seymour. Graph minors XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B, 63(1):65-110, 1995.
22. [Sch94] P. Scheffler. A practical linear time algorithm for vertex disjoint paths in graphs with bounded treewidth. Technical Report 396, Dept. of Mathematics, Technische Universität Berlin, 1994.
23. [Tod03] I. Todinca. Coloring powers of graphs of bounded clique-width. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 2880 of LNCS, pages 370-382. Springer-Verlag, 2003.
24. [Wan94] E. Wanke. k-NLC graphs and polynomial algorithms. Discr. Applied Mathematics, 54:251-266, 1994. revised version: "http://www.cs.uni- duesseldorf.de/~wanke".