Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph-Theoretic Concepts in Computer Science

WG 1988: Graph-Theoretic Concepts in Computer Science pp 317–326Cite as

On the estimate of the size of a directed graph

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 344))

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".

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hall, M., D.E.Knuth, "Combinatorial Analysis and Computers, part II", American Mathematical Monthly, February 1965.

    Google Scholar 

  2. Knuth, D., "Estimating the Efficiency of Backtrack Programs", Math. Comp. 29, pp. 121–136, 1975.

    Google Scholar 

  3. Marchetti-Spaccamela, A., "Monte Carlo Estimates of the Size of Relations in Deductive Databases", manuscript, 1988.

    Google Scholar 

  4. Pitt, L., "A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graph", Information Processing Letters vol. 24, pp.203–206, 1987.

    Google Scholar 

  5. Reingold, E.M., J. Nievergelt, N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice Hall, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics, University of L'Aquila, via Roma, 67100, L'Aquila, Italy

    A. Marchetti-Spaccamela

Authors
  1. A. Marchetti-Spaccamela
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation