An exponential time parameterized algorithm for planar disjoint paths

DOI10.1137/20M1355902MaRDI QIDQ7006889zbMATH OpenFDO

Authors Daniel Lokshtanov, Pranabendu Misra, Michał Pilipczuk, Saket Saurabh, Meirav Zehavi

Publication date 27 March 2025

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

graph minorsparameterized complexityalgebraic flowplanar disjoint paths

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Planar graphs; geometric and topological aspects of graph theory (05C10) Flows in graphs (05C21) Paths and cycles (05C38) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: An exponential time parameterized algorithm for planar disjoint paths

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