arXiv (All)
open access
A Faster Algorithm for Fewer Vertex-Disjoint Paths Parameterized by Treewidth
The $k$ vertex-disjoint paths problem asks whether, given a graph $G$ and $k$ pairs of vertices $(s_1,t_1)$, \ldots, $(s_k,t_k)$, $G$ has $k$ pairwise vertex-disjoint paths connecting $s_i$ and $t_i$ for all $1\leq i\leq k$. If $G$ is undirected, then this problem is NP-complete, but there exist FPT
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Polynomial-time algorithms for Path Cover and Path Partition on trees and graphs of bounded treewidth#677074
- A Counterexample to Wormald's Conjecture#1154709
- Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics#1117539
- Destroying symmetry by orienting edges: Complete graphs and complete bigraphs#490166
- Decomposing complete multipartite graphs into closed trails of arbitrary even lengths#955096
Record · ID 1077223
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive