Courcelle's theorem for triangulations
From MaRDI portal
Publication:346450
DOI10.1016/j.jcta.2016.10.001zbMath1353.05122arXiv1403.2926OpenAlexW2963396031MaRDI QIDQ346450
Rodney G. Downey, Benjamin A. Burton
Publication date: 29 November 2016
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.2926
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Algorithms and Complexity for Turaev-Viro Invariants ⋮ On the pathwidth of hyperbolic 3-manifolds ⋮ Traversing three-manifold triangulations and spines ⋮ Unnamed Item ⋮ Treewidth, crushing and hyperbolic volume ⋮ Unnamed Item ⋮ Algorithms and complexity for Turaev-Viro invariants ⋮ The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Courcelle's theorem -- a game-theoretic approach
- Sparsity. Graphs, structures, and algorithms
- Veering triangulations admit strict angle structures
- Monadic second-order evaluations on tree-decomposable graphs
- Finite covers of random 3-manifolds
- State sum invariants of 3-manifolds and quantum \(6j\)-symbols
- A user's guide to discrete Morse theory
- Taut ideal triangulations of \(3\)-manifolds
- Which problems have strongly exponential complexity?
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- A new decomposition theorem for 3-manifolds
- The parametrized complexity of knot polynomials
- 0-efficient triangulations of 3-manifolds
- Parametrized complexity theory.
- Tight lower bounds for certain parameterized NP-hard problems
- Parameterized Complexity of Discrete Morse Theory
- Computational topology with Regina: Algorithms, heuristics and implementations
- Fixed Parameter Tractable Algorithms in Combinatorial Topology
- Seifert fibered spaces in 3-manifolds
- Easy problems for tree-decomposable graphs
- STRUCTURES OF SMALL CLOSED NON-ORIENTABLE 3-MANIFOLD TRIANGULATIONS
- Graph minors. II. Algorithmic aspects of tree-width
- Deciding First-Order Properties of Nowhere Dense Graphs
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Computing Optimal Morse Matchings
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- The complexity of detecting taut angle structures on triangulations
- Algorithmic topology and classification of 3-manifolds
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
This page was built for publication: Courcelle's theorem for triangulations
