Vertex disjoint paths on clique-width bounded graphs
From MaRDI portal
Publication:2503296
Recommendations
Cites work
- \(k\)-NLC graphs and polynomial algorithms
- A Linear Recognition Algorithm for Cographs
- Approximating clique-width and branch-width
- Clique partitions, graph compression and speeding-up algorithms
- Coloring powers of graphs of bounded clique-width.
- Deciding Clique-Width for Graphs of Bounded Tree-Width
- Edge dominating set and colorings on graphs with fixed clique-width
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. XIII: The disjoint paths problem
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- scientific article; zbMATH DE number 1953082 (Why is no real title available?)
- scientific article; zbMATH DE number 2044924 (Why is no real title available?)
- scientific article; zbMATH DE number 2044928 (Why is no real title available?)
- scientific article; zbMATH DE number 1472167 (Why is no real title available?)
- scientific article; zbMATH DE number 1512682 (Why is no real title available?)
- Linear time solvable optimization problems on graphs of bounded clique-width
- Nearest common ancestors: a survey and a new algorithm for a distributed environment
- NLC\(_{2}\)-decomposition in polynomial time
- On simple characterizations of k-trees
- On the clique-width of some perfect graph classes
- On the complexity of the disjoint paths problem
- On the Complexity of Timetable and Multicommodity Flow Problems
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- The edge-disjoint paths problem is NP-complete for series-parallel graphs
- Upper bounds to the clique width of graphs
Cited in
(19)- The NLC-width and clique-width for powers of graphs of bounded tree-width
- On \textsf{NC} algorithms for problems on bounded rank-width graphs
- Constrained-path labellings on graphs of bounded clique-width
- Comparing linear width parameters for directed graphs
- Polynomial algorithms for protein similarity search for restricted mRNA structures
- Digraph width measures in parameterized algorithmics
- Line graphs of bounded clique-width
- Induced disjoint paths in circular-arc graphs in linear time
- Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs
- On digraph width measures in parameterized algorithmics
- Finding disjoint paths in split graphs
- The behavior of clique-width under graph operations and graph transformations
- Disjoint paths and connected subgraphs for \(H\)-free graphs
- Disjoint paths and connected subgraphs for \(H\)-free graphs
- A tight Monte-Carlo algorithm for Steiner tree parameterized by clique-width
- Kernels for the disjoint paths problem on subclasses of chordal graphs
- Kernels for the disjoint paths problem on subclasses of chordal graphs
- Directed NLC-width
- Algorithmic aspects of switch cographs
This page was built for publication: Vertex disjoint paths on clique-width bounded graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503296)
