Regular ArticleAverage Costs of a Graph Exploration: Upper and Lower Bounds☆
References (16)
- et al.
Linear expected time algorithms for connectivity problems
J. Algorithms
(1980) - et al.
The Probabilistic Method
(1992) A note on two problems in connexion with graphs
Numer. Math.
(1959)- et al.
On the evolution of random graphs
Publ. Hung. Acad. Sci.
(1960) Graph Algorithms
(1979)- et al.
Fibonacci heaps and their uses in improved network optimization algorithms
J. Assoc. Comput. Mach.
(1987) The transitive closure of a random digraph
Random Structures Algorithms
(1990)
There are more references available in the full text version of this article.
Cited by (0)
- ☆
This work was in part supported by the Schweizerischer Nationalfond, Project 2100-043537.95.
Copyright © 2000 Academic Press. All rights reserved.