Fixed-Parameter Tractability for Non-Crossing Spanning Trees

DOI10.1007/978-3-540-73951-7_36zbMath1209.68278OpenAlexW1599785870MaRDI QIDQ3603545

Christian Knauer, Takeshi Tokuyama, Magnús M. Halldórsson, Andreas Spillner

Publication date: 17 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_36

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Parameterized analysis and crossing minimization problems ⋮ Grid recognition: classical and parameterized computational perspectives ⋮ Connecting the dots (with minimum crossings)

This page was built for publication: Fixed-Parameter Tractability for Non-Crossing Spanning Trees