Chip-firing games on Eulerian digraphs and -hardness of computing the rank of a divisor on a graph.
Viktor KissLilla TóthmérészPublished in: Discret. Appl. Math. (2015)
Keyphrases
- directed graph
- equivalence classes
- undirected graph
- graph representation
- low cost
- graphical representation
- computational complexity
- graph theory
- graph matching
- video games
- game theory
- homology generators
- structured data
- random walk
- high speed
- circuit design
- np hard
- bipartite graph
- game play
- graph mining
- game design
- graph databases
- nash equilibrium
- high density
- learning theory
- phase transition
- connected components
- adjacency matrix
- analog vlsi
- information theoretic