Chip-firing games on Eulerian digraphs and -hardness of computing the rank of a divisor on a graph
暂无分享,去创建一个
[1] Matthew Baker,et al. Specialization of linear systems from curves to graphs , 2007 .
[2] Ye Luo. Rank-determining sets of metric graphs , 2011, J. Comb. Theory, Ser. A.
[3] Kévin Perrot,et al. NP-hardness of minimum feedback arc set problem on Eulerian digraphs and minimum recurrent configuration problem of Chip-firing game , 2013, ArXiv.
[4] Madhusudan Manjunath. The rank of a divisor on a finite graph: geometry and computation , 2011 .
[5] Robert Cori,et al. The Riemann-Roch theorem for graphs and the rank in complete graphs , 2013, 1308.5325.
[6] László Lovász,et al. Chip-firing Games on Graphs , 1991, Eur. J. Comb..
[7] László Lovász,et al. Chip-Firing Games on Directed Graphs , 1992 .
[8] Arash Asadi,et al. Chip-Firing and Riemann-Roch Theory for Directed Graphs , 2010, Electron. Notes Discret. Math..
[9] Serguei Norine,et al. Riemann–Roch and Abel–Jacobi theory on a finite graph , 2006, math/0608360.
[10] D. Welsh,et al. Special Issue in Honour of James Oxley , 2015 .
[11] Matthew Baker,et al. Chip-firing games, potential theory on graphs, and spanning trees , 2011, J. Comb. Theory, Ser. A.
[12] Omid Amini,et al. Riemann-Roch for Sub-Lattices of the Root Lattice An , 2010, Electron. J. Comb..
[13] Omid Amini,et al. Riemann-Roch for Sublattices of the Root Lattice A n , 2010 .
[14] Jan Hladký,et al. Rank of divisors on tropical curves , 2007, J. Comb. Theory, Ser. A.
[15] Trung Van Pham,et al. Feedback Arc Set Problem and NP-Hardness of Minimum Recurrent Configuration Problem of Chip-Firing Game on Directed Graphs , 2013, 1303.3708.