Tight Bounds for Linkages in Planar Graphs

DOI10.1007/978-3-642-22006-7_10zbMath1333.05280MaRDI QIDQ3012796

Saket Saurabh, Daniel Lokshtanov, Dimitrios M. Thilikos, Stavros G. Kolliopoulos, Isolde Adler, Philipp Klaus Krause

Publication date: 6 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_10

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)