Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter.
C. Scheideler, A. Padalkin, in: PODC 2024: 65-75, 2024, pp. 65–75.
Download
No fulltext has been uploaded.
Conference Paper
| English
Department
Publishing Year
Page
65 - 75
LibreCat-ID
Cite this
Scheideler C, Padalkin A. Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. . In: ; 2024:65-75.
Scheideler, C., & Padalkin, A. (2024). Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. . 65–75.
@inproceedings{Scheideler_Padalkin_2024, place={PODC 2024: 65-75}, title={Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. }, author={Scheideler, Christian and Padalkin, Andreas}, year={2024}, pages={65–75} }
Scheideler, Christian, and Andreas Padalkin. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ,” 65–75. PODC 2024: 65-75, 2024.
C. Scheideler and A. Padalkin, “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ,” 2024, pp. 65–75.
Scheideler, Christian, and Andreas Padalkin. Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. . 2024, pp. 65–75.
Google Scholar