On the exact complexity of Hamiltonian Cycle and q-Colouring in disk graphs
DOI10.1007/978-3-319-57586-5_31zbMATH Open1486.68134OpenAlexW2607365952MaRDI QIDQ5283382FDOQ5283382
Authors: Sándor Kisfaludi-Bak, Tom C. van der Zanden 
Publication date: 21 July 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_31
Recommendations
- Exact algorithms for the Hamiltonian cycle problem in planar graphs
- Fine-grained complexity of coloring unit disks and balls
- Fast exact algorithms for Hamiltonicity in claw-free graphs
- Fine-grained complexity of coloring unit disks and balls
- The complexity of colouring circle graphs (extended abstract)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- On coloring unit disk graphs
- Hamilton Paths in Grid Graphs
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Parameterized algorithms
- Separators for sphere-packings and nearest neighbor graphs
- Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
- Exact algorithms for the Hamiltonian cycle problem in planar graphs
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Cut and count and representative sets on branch decompositions
Cited In (3)
This page was built for publication: On the exact complexity of Hamiltonian Cycle and \(q\)-Colouring in disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283382)
