Last change: 02.02.2024 10:23.
by
Disser, Y. and Klimm, M.
Reference:
Disser, Y. and Klimm, M.: "The Space Complexity of Undirected Graph Exploration", Chapter in Algorithms for Big Data (Bast, H.; Korzen, C.; Meyer, U.; Penschuck, M., eds.), Springer, pp. 152–166, 2023.
Bibtex Entry:
@incollection{DisserKlimm/23,
title={The Space Complexity of Undirected Graph Exploration},
author={Disser, Y. and Klimm, M.},
booktitle={Algorithms for Big Data},
pages={152--166},
year={2023},
publisher = {Springer},
editor={Bast, H. and Korzen, C. and Meyer, U. and Penschuck, M.},
series={DFG Priority Program 1736},
} 
