Space-Efficient Implementations of Graph Search Methods

DOI10.1145/356044.356048MaRDI QIDQ3038636zbMATH OpenOpenAlexFDO

Authors Robert E. 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

breadth-first searchdepth-first searchlist markingspace-efficient implementations

Mathematics Subject Classification ID

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

Cited in

(4)

• Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés
• Efficient polynomial algorithms for distributive lattices
• Finding strong components using depth-first search
• Frameworks for designing in-place graph algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3038636)