Skip to main content
Journal Article

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) (2004) 2976 119-128
DOI: 10.1007/978-3-540-24698-5_16
9Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that l vertex disjoint paths between l pairs of vertices can be found in linear time for co-graphs but is NP-complete for graphs of NLC-width at most 4 and clique-width at most 7. This is the first inartificial graph problem known to be NP-complete on graphs of bounded clique-width but solvable in linear time on co-graphs and graphs of bounded tree-width. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Gurski, F., & Wanke, E. (2004). 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), 2976, 119–128. https://doi.org/10.1007/978-3-540-24698-5_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free