arXiv (All)
open access
Parameterized Complexity of Isometric Path Cover: Treewidth and Diameter
We study the fixed-parameter tractability of the \textsc{Isometric Path Cover} problem where, given an integer $k$ and a simple, undirected, and unweighted graph $G$, the objective is to decide whether $G$ admits a set of $k$ isometric paths (i.e., shortest paths between their endpoints) whose union
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
- A Faster Algorithm for Fewer Vertex-Disjoint Paths Parameterized by Treewidth#1077223
- Polynomial directed treewidth forces a large bramble with congestion two#1297622
- Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth#1051978
- Decomposing complete multipartite graphs into closed trails of arbitrary even lengths#955096
- Improved lower bounds on the maximum size of graphs with girth 5#1061619
Record · ID 1357665
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