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

DOI10.1016/0020-0190(87)90187-6MaRDI QIDQ1108027zbMATH OpenOpenAlexFDO

Authors 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

backtrack searchdirected acyclic graphsestimationrandomized algorithms

Mathematics Subject Classification ID

Data structures (68P05) 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)

Cites work

• Backtrack Programming
• Combinatorial Analysis and Computers
• Estimating the Efficiency of Backtrack Programs
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 3231892 (Why is no real title available?)

Cited in

(2)

• Estimating sizes of social networks via biased sampling
• On the estimate of the size of a directed graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108027)