List Colouring Trees in Logarithmic Space

DSpace/Manakin Repository

List Colouring Trees in Logarithmic Space
 
Bodlaender, Hans L.; Groenland, Carla; Jacob, Hugo
(2022)
30th Annual European Symposium on Algorithms, ESA 2022, volume 244, pp. 24:1 - 24:15
Leibniz International Proceedings in Informatics, LIPIcs, volume 244, pp. 24:1 - 24:15
30th Annual European Symposium on Algorithms, ESA 2022, volume 244, pp. 24:1 - 24:15
(Part of book)
Abstract
We show that List Colouring can be solved on n-vertex trees by a deterministic Turing machine using O(log n) bits on the worktape. Given an n-vertex graph G = (V,E) and a list L(v) ⊆ {1, . . . , n} of available colours for each v ∈ V , ... read more
Download/Full Text
Open Access version via Utrecht University Repository Publisher version
 
Keywords: graph algorithms, List colouring, logspace, space complexity, treepartition-width, trees, Software
DOI: https://doi.org/10.4230/LIPIcs.ESA.2022.24
ISSN: 1868-8969
ISBN: 9783959772471
9783959772471
Publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Note: Funding Information: Funding Carla Groenland: Supported by the project CRACKNP that has received funding from the European Research Council (grant agreement No 853234). Publisher Copyright: © 2022 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.
(Peer reviewed)
 
 
See more statistics about this item