Average Costs of a Graph Exploration: Upper and Lower Bounds

DOI10.1006/JAGM.1999.1053MaRDI QIDQ4943074zbMATH OpenOpenAlexFDO

Authors Nicola Galli

Publication date 2000

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/76276722afaf3aac3912d1d15677c6cccee8db29

zbMATH Keywords

algorithm evaluationsBFSDFSgraph algorithmsMSTSSSP

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Online graph exploration: New results on old and new algorithms
• Online Graph Exploration: New Results on Old and New Algorithms
• Exploring an unknown graph
• Lower and upper competitive bounds for online directed graph exploration
• Algorithms – ESA 2005

Cited in

(1)

• Undirected Graph Exploration with ⊝(log log n) Pebbles

This page was built for publication: Average Costs of a Graph Exploration: Upper and Lower Bounds

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