Space-Efficient Implementations of Graph Search Methods

DOI10.1145/356044.356048zbMath0525.68043OpenAlexW2016555055MaRDI QIDQ3038636

Robert Endre Tarjan

Publication date: 1983

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/356044.356048

zbMATH Keywords

depth-first searchbreadth-first searchlist markingspace-efficient implementations

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (3)

Frameworks for designing in-place graph algorithms ⋮ Efficient polynomial algorithms for distributive lattices ⋮ Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés

This page was built for publication: Space-Efficient Implementations of Graph Search Methods