On the estimate of the size of a directed graph

DOI10.1007/3-540-50728-0_54OpenAlexW1275991311MaRDI QIDQ6199473

No author found.

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-50728-0_54

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Estimating Sizes of Social Networks via Biased Sampling

Cites Work

• Unnamed Item
• A note on extending Knuth's tree estimator to directed acyclic graphs
• Estimating the Efficiency of Backtrack Programs

This page was built for publication: On the estimate of the size of a directed graph