The Space Complexity of Undirected Graph Exploration

Disser, Y.; Klimm, M.

by Disser, Y. and Klimm, M.

Reference:

The Space Complexity of Undirected Graph Exploration (Disser, Y. and Klimm, M.), Chapter in Algorithms for Big Data (Bast, H., Korzen, C., Meyer, U., Penschuck, M., eds.), Springer, 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},
 chapter = {8},
 publisher = {Springer},
 editor = {Bast, H. and Korzen, C. and Meyer, U. and Penschuck, M.},
 series = {DFG Priority Program 1736},
}