Average Costs of a Graph Exploration: Upper and Lower Bounds

DOI10.1006/JAGM.1999.1053zbMATH Open1081.68659OpenAlexW1985727096MaRDI QIDQ4943074

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

BFSMSTgraph algorithmsDFSSSSPalgorithm evaluations

Mathematics Subject Classification ID

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

Related Items (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)