Decremental optimization of vertex-colouring under the reconfiguration framework

Suppose that we are given a positive integer k, and a k-(vertex-)colouring of a given graph G. Then we are asked to find a colouring of G using the minimum number of colours among colourings that are reachable from by iteratively changing a colour assignment of exactly one vertex while maintaining t...

Celý popis

Podrobná bibliografia

Vydané v:	International journal of computer mathematics. Computer systems theory Ročník 8; číslo 1; s. 80 - 92
Hlavní autori:	Yanagisawa, Yusuke, Suzuki, Akira, Tamura, Yuma, Zhou, Xiao
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Taylor & Francis 02.01.2023
Predmet:	Combinatorial reconfiguration graph algorithms graph colouring linear-time algorithms
ISSN:	2379-9927, 2379-9935
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!