Polynomial time algorithm for ARRIVAL on tree-like multigraphs

DOI10.4230/LIPICS.MFCS.2022.12MaRDI QIDQ6584004zbMATH OpenFDO

Authors David Auger, Pierre Coucheney, Loric Duhazé

Publication date 6 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2022.12

zbMATH Keywords

game theoryreachability problemrotor walkrotor-routingtree-like multigraph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

• A quasi-polynomial time algorithm for multi-arrival on tree-like multigraphs

This page was built for publication: Polynomial time algorithm for ARRIVAL on tree-like multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584004)