Optimal Bounds for the k-Disjoint Paths Problem

MaRDI QIDQ7251393arXivFDO

Authors Dario Cavallaro, Maximilian Gorsky, Stephan Kreutzer, Dimitrios M. Thilikos, Sebastian Wiederrecht

Publication date 2026

Published in arXiv

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

arXiv classification

math.CO

This page was built for publication: Optimal Bounds for the k-Disjoint Paths Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7251393)