The k-Disjoint Paths Problem on Chordal Graphs

DOI10.1007/978-3-642-11409-0_17zbMath1273.68278OpenAlexW1605572092MaRDI QIDQ5851105

Frank Kammer, Torsten Tholey

Publication date: 21 January 2010

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Approximation and Kernelization for Chordal Vertex Deletion ⋮ Finding disjoint paths in split graphs ⋮ Parameterized complexity of set-restricted disjoint paths on chordal graphs ⋮ Min-sum 2-paths problems

This page was built for publication: The k-Disjoint Paths Problem on Chordal Graphs