Login / Signup
Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph.
Viktor Kiss
Lilla Tóthmérész
Published in:
CoRR (2014)
Keyphrases
</>
np hardness
directed graph
np hard
equivalence classes
approximation algorithms
random walk
undirected graph
worst case analysis
mixed integer
discrete tomography
graphical representation
game theory
computer games
graph structure