List Colouring Trees in Logarithmic Space

Autor:	Bodlaender, Hans L., Groenland, Carla, Jacob, Hugo
Rok vydání:	2022
Předmět:	Computer Science - Discrete Mathematics Computer Science - Computational Complexity Computer Science - Data Structures and Algorithms
Druh dokumentu:	Working Paper
Popis:	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)\subseteq\{1,\dots,n\}$ of available colours for each $v\in V$, a list colouring for $G$ is a proper colouring $c$ such that $c(v)\in L(v)$ for all $v$. Comment: 18 pages, accepted to ESA
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2206.09750 Zobrazit plný text záznamu View this record from Arxiv