Fixed Parameter Tractable Algorithms in Combinatorial Topology

DOI10.1007/978-3-319-08783-2_26zbMath1423.68205arXiv1402.3876OpenAlexW3123431247MaRDI QIDQ2920468

William Pettersson, Benjamin A. Burton

Publication date: 26 September 2014

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

Full work available at URL: https://arxiv.org/abs/1402.3876

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Triangulating manifolds (57Q15) Relations of low-dimensional topology with graph theory (57M15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Courcelle's theorem for triangulations ⋮ On the pathwidth of hyperbolic 3-manifolds ⋮ The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex

This page was built for publication: Fixed Parameter Tractable Algorithms in Combinatorial Topology