Linear extensions of rotor-routing in directed graphs: reachability problems
From MaRDI portal
Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Dynamical aspects of cellular automata (37B15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites work
- A distributed ant algorithm for efficiently patrolling a network
- Algorithmic aspects of rotor-routing and the notion of linear equivalence
- ARRIVAL: a zero-player graph game in \(\text{NP}\cap \text{coNP}\)
- ARRIVAL: next stop in CLS
- Chip-Firing and Rotor-Routing on Directed Graphs
- Chip-firing games on directed graphs
- Chip-firing games on graphs
- CoEulerian graphs
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 871943 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- Local-to-global principles for the hitting sequence of a rotor walk
- On simplified NP-complete variants of \textsc{Monotone 3-Sat}
- Parallel program schemata
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Rotor-routing reachability is easy, chip-firing reachability is hard
- The Smith normal form
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Tree formulas, mean first passage times and Kemeny's constant of a Markov chain
This page was built for publication: Linear extensions of rotor-routing in directed graphs: reachability problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7234740)
