Complexity of computing the rotor-router action
Statement
Let be an undirected graph. What is the complexity of computing the rotor-router action of the sandpile group of on the spanning trees of ?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.