Hypergraph Coloring Games and Voter Models

DOI10.1007/978-3-642-30541-2_1zbMath1342.05087OpenAlexW2174979222MaRDI QIDQ2900580

Alexander Tsiatas, Fan R. K. Chung

Publication date: 23 July 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-30541-2_1

zbMATH Keywords

memoryless gamenetwork coloring game on hypergraphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Hypergraphs (05C65) Games involving graphs (91A43) Voting theory (91B12) Games on graphs (graph-theoretic aspects) (05C57) Random walks on graphs (05C81)

Related Items (3)

Mixing times for exclusion processes on hypergraphs ⋮ Voter Model on Signed Social Networks ⋮ Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs

This page was built for publication: Hypergraph Coloring Games and Voter Models