Publisher
Springer Nature Switzerland
Reference17 articles.
1. Auger, D., Coucheney, P., Duhazé, L.: Polynomial time algorithm for arrival on tree-like multigraphs. In: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2022)
2. Auger, D., Coucheney, P., Duhazé, L., Etse, K.R.: Generalized arrival problem for rotor walks in path multigraphs. arXiv preprint arXiv:2307.01897 (2023)
3. Björner, A., Lovász, L.: Chip-firing games on directed graphs. J. Algebraic Combin. 1, 305–328 (1992)
4. Björner, A., Lovász, L., Shor, P.W.: Chip-firing games on graphs. Eur. J. Comb. 12(4), 283–291 (1991)
5. Dohrau, J., Gärtner, B., Kohler, M., Matoušek, J., Welzl, E.: ARRIVAL: a zero-player graph game in NP $$\cap $$ coNP. In: Loebl, M., Nešetřil, J., Thomas, R. (eds.) A Journey Through Discrete Mathematics, pp. 367–374. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-44479-6_14
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献