On Complexity of Flooding Games on Graphs with Interval Representations

DOI10.1007/978-3-642-45281-9_7zbMath1407.05161arXiv1206.6201OpenAlexW2163537649MaRDI QIDQ2864330

Yushi Uno, Takeaki Uno, Ryuhei Uehara, Yota Otachi, Hiroyuki Fukui

Publication date: 6 December 2013

Published in: Computational Geometry and Graphs (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph representations (geometric and intersection representations, etc.) (05C62) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (6)

Unnamed Item ⋮ A Survey on the Complexity of Flood-Filling Games ⋮ How Bad is the Freedom to Flood-It? ⋮ Flooding games on graphs ⋮ Spanning trees and the complexity of flood-filling games ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\)

This page was built for publication: On Complexity of Flooding Games on Graphs with Interval Representations