Complexity of computing the rotor-router action

From Egres Open
Jump to: navigation, search


What is the complexity of computing the rotor-router action of the Picard group on the spanning in-arborescences of a graph?


Remarks

  • The rotor-router action has been defined by Holroyd et al. [1].

References

  1. A. E. Holroyd, L. Levine, K. Mészáros, Y. Peres, J. Propp, D. B. Wilson, Chip-Firing and Rotor-Routing on Directed Graphs, Progress in Probability (2008) DOI link, Author Link