Disjoint paths and connected subgraphs for \(H\)-free graphs
From MaRDI portal
Publication:5918624
DOI10.1007/978-3-030-79987-8_29OpenAlexW3160792420MaRDI QIDQ5918624
Erik Jan van Leeuwen, Daniël Paulusma, Barnaby Martin, Siani Smith, Walter Kern
Publication date: 22 March 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-79987-8_29
Related Items (1)
Cites Work
- Unnamed Item
- The disjoint paths problem in quadratic time
- Removing local extrema from imprecise terrains
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\)
- Finding disjoint paths in split graphs
- On partitioning a graph into two connected subgraphs
- Partitioning graphs into connected parts
- Paw-free graphs
- Complement reducible graphs
- Graph minors. XIII: The disjoint paths problem
- Vertex disjoint paths on clique-width bounded graphs
- Connecting Terminals and 2-Disjoint Connected Subgraphs
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- Path Contraction Faster than $2^n$
- A Polynomial Solution to the Undirected Two Paths Problem
- On the Computational Complexity of Combinatorial Problems
- On the Complexity of Timetable and Multicommodity Flow Problems
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Contracting to a longest path in H-free graphs
This page was built for publication: Disjoint paths and connected subgraphs for \(H\)-free graphs
