Rotor-routing reachability is easy, chip-firing reachability is hard (Q2066002): Difference between revisions

@@ Property / arXiv ID @@
+.11970
@@ Property / arXiv ID: 2102.11970 / rank @@
+Normal rank
@@ Property / cites work @@
+Riemann-Roch and Abel-Jacobi theory on a finite graph
+Normal rank
@@ Property / cites work @@
+Chip-firing games on directed graphs
@@ Property / cites work: Chip-firing games on directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Chip-firing games on graphs
@@ Property / cites work: Chip-firing games on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Abelian Networks I. Foundations and Examples
@@ Property / cites work: Abelian Networks I. Foundations and Examples / rank @@
+Normal rank
@@ Property / cites work @@
+CoEulerian graphs
@@ Property / cites work: CoEulerian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Chip-Firing and Rotor-Routing on Directed Graphs
@@ Property / cites work: Chip-Firing and Rotor-Routing on Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the chip-firing reachability problem
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic aspects of rotor-routing and the notion of linear equivalence
+Normal rank
@@ Property / cites work @@
+Orbits of rotor-router operation and stationary distribution of random walks on directed graphs
+Normal rank