Abstract
Given a directed graph and a source node x0 we want to know the number of nodes that are connected to x0, without searching the whole graph. We give biased and unbiased estimators extending previous results by Knuth and Pitt.
work partially supported by project MPI "Progetto e analisi di algoritmi".
Preview
Unable to display preview. Download preview PDF.
References
Hall, M., D.E.Knuth, "Combinatorial Analysis and Computers, part II", American Mathematical Monthly, February 1965.
Knuth, D., "Estimating the Efficiency of Backtrack Programs", Math. Comp. 29, pp. 121–136, 1975.
Marchetti-Spaccamela, A., "Monte Carlo Estimates of the Size of Relations in Deductive Databases", manuscript, 1988.
Pitt, L., "A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graph", Information Processing Letters vol. 24, pp.203–206, 1987.
Reingold, E.M., J. Nievergelt, N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice Hall, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marchetti-Spaccamela, A. (1989). On the estimate of the size of a directed graph. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1988. Lecture Notes in Computer Science, vol 344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50728-0_54
Download citation
DOI: https://doi.org/10.1007/3-540-50728-0_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50728-4
Online ISBN: 978-3-540-46076-3
eBook Packages: Springer Book Archive