On a game in directed graphs

Authors:
Alan J. Hoffman;Kate Jenkins;Tim Roughgarden
Affiliations:
IBM Watson Research Center, Yorktown Heights, NY 10598, USA;Akamai Technologies, Cambridge, MA, USA;Department of Computer Science, Cornell University, Ithaca, NY 14853, USA
Venue:
Information Processing Letters
Year:
2002

Citing 4
Cited 0

Time and message bounds for election in synchronous and asynchronous complete networks

SIAM Journal on Computing
Distributed Algorithms for Unidirectional Networks

SIAM Journal on Computing
Leader Election in Complete Networks

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.89

Visualization

Abstract

Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any) and eliminates the other endpoint of this arc; the remaining vertices play on until no arcs remain. We call a directed graph lethal if the game must end with all vertices eliminated and mortal if it is possible that the game ends with all vertices eliminated. We show that lethal graphs are precisely collections of vertex-disjoint cycles, and that the problem of deciding whether or not a given directed graph is mortal is NP-complete (and hence it is likely that no "nice" characterization of mortal graphs exists).