A note on extending Knuth's tree estimator to directed acyclic graphs

DOI10.1016/0020-0190(87)90187-6zbMath0653.68059OpenAlexW2020454559MaRDI QIDQ1108027

Leonard Pitt

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90187-6

zbMATH Keywords

estimationbacktrack searchrandomized algorithmsdirected acyclic graphs

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Related Items (2)

On the estimate of the size of a directed graph ⋮ Estimating Sizes of Social Networks via Biased Sampling

Cites Work

• Estimating the Efficiency of Backtrack Programs
• Combinatorial Analysis and Computers
• Backtrack Programming
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on extending Knuth's tree estimator to directed acyclic graphs