BFS versus DFS for random targets in ordered trees

MaRDI QIDQ6529707arXivFDO

Authors Stoyan Ivanov Dimitrov, Martin Minchev, Yan Zhuang

Published in arXiv

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Trees (05C05) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

This page was built for publication: BFS versus DFS for random targets in ordered trees

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