Faster graph coloring in polynomial space

DOI10.1007/978-3-319-62389-4_31zbMath1435.68233arXiv1607.06201OpenAlexW2962886649MaRDI QIDQ5920158

Serge Gaspers, Edward J. Lee

Publication date: 23 October 2017

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

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Approximately counting independent sets in bipartite graphs via graph containers ⋮ Faster exponential-time algorithms for approximately counting independent sets ⋮ NP-completeness results for partitioning a graph into total dominating sets ⋮ Faster graph coloring in polynomial space ⋮ Exponential-time quantum algorithms for graph coloring problems

This page was built for publication: Faster graph coloring in polynomial space