Conceptio › Archive › HAL (France)
HAL (France)open access

Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems

David Auger et al.
HAL (France) · Papers · License: Open Access
Open Source ↗
computationalcomplexity
Graphs and linear algebra, Computational complexity, Reachability Problem, 1, 0
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 284320
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.