Chip-firing games on Eulerian digraphs and -hardness of computing the rank of a divisor on a graph

@article{Kiss2015ChipfiringGO,
  title={Chip-firing games on Eulerian digraphs and -hardness of computing the rank of a divisor on a graph},
  author={Viktor Kiss and Lilla T{\'o}thm{\'e}r{\'e}sz},
  journal={Discret. Appl. Math.},
  year={2015},
  volume={193},
  pages={48-56}
}

Figures from this paper

On approximating the rank of graph divisors

TLDR
This paper strengthens Kiss and T´othm´eresz's result by establishing a connection between chip-firing games and the Minimum Target Set Selection problem, and shows that the rank is difficult to approximate to within a factor of O (2 log 1 − ε n ) for any ε > 0 unless P = NP.

Chip-firing based methods in the Riemann-Roch theory of directed graphs

On Computation of Baker and Norine's Rank on Complete Graphs

TLDR
An algorithm for the determination of the rank of configurations for the complete graph K_n and an apparently new parameter which is called the prerank is presented which provides an alternative description to some well known $ q,t$-Catalan numbers.

CoEulerian graphs

We suggest a measure of “Eulerianness” of a finite directed graph and define a class of “coEulerian” graphs. These are the graphs whose Laplacian lattice is as large as possible. As an application,

Computing graph gonality is hard

Sparse Graphs of High Gonality

TLDR
It is shown that there are connected graphs of treewidth 2 of arbitrarily high gonality and that there exist pairs of connected graphs such that H has strictly lower gonality than G.

Computing divisorial gonality is hard

The gonality gon(G) of a graph G is the smallest degree of a divisor of positive rank in the sense of Baker-Norine. In this note we show that computing gon(G) is NP-hard by a reduction from the

Linear time algorithm for computing the rank of divisors on cactus graphs

TLDR
A linear time algorithm is described for computing rank of divisor on graph limited on cactus graphs and it is shown that this problem is NP-hard.

graph gonality is hard.

The divisorial gonality of a graph G, denoted by dgon(G) is the smallest degree of a divisor of positive rank in the sense ofM. Baker and S. Norine [Adv. Math. 215, No. 2, 766–788 (2007; Zbl

References

SHOWING 1-10 OF 16 REFERENCES

Chip-firing games, potential theory on graphs, and spanning trees

The rank of a divisor on a finite graph: geometry and computation

TLDR
An algorithm whose running time is polynomial for a multigraph with a fixed number of vertices and a new graph invariant that is the critical automorphism group of the graph that is motivated by this proof and its generalisations.

The Riemann-Roch theorem for graphs and the rank in complete graphs

The paper by M. Baker and S. Norine in 2007 introduced a new parameter on configurations of graphs and gave a new result in the theory of graphs which has an algebraic geometry flavour. This result

Chip-Firing and Riemann-Roch Theory for Directed Graphs

NP-hardness of minimum feedback arc set problem on Eulerian digraphs and minimum recurrent configuration problem of Chip-firing game

TLDR
This paper points out a close relationship between MINREC and the minimum feedback arc set (MINFAS) problem on Eulerian directed graphs, and proves that both problems are NP-hard.

Chip-Firing Games on Directed Graphs

TLDR
It is shown that for many graphs, in particular for undirected graphs, the problem whether a given position of the chips can be reached from the initial position is polynomial time solvable.

Rank-determining sets of metric graphs

  • Ye Luo
  • Mathematics, Computer Science
    J. Comb. Theory, Ser. A
  • 2011

Feedback Arc Set Problem and NP-Hardness of Minimum Recurrent Configuration Problem of Chip-Firing Game on Directed Graphs

TLDR
This paper points out a close relationship between MINREC and the minimum feedback arc set (MINFAS) problem on Eulerian directed graphs, and proves that both problems are NP-hard.

Rank of divisors on tropical curves