scientific article; zbMATH DE number 1334602

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199907)14:4<309::AID-RSA2>3.0.CO;2-1" /><309::AID-RSA2>3.0.CO;2-1 10.1002/(SICI)1098-2418(199907)14:4<309::AID-RSA2>3.0.CO;2-1zbMath0936.05079MaRDI QIDQ4262221

Zamora-Cura, Carlos, Luc P. Devroye

Publication date: 18 May 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexityrandom graphssearch algorithmdepth-first searchrandom variablerandom treesbranch-and-bound algorithmstree searchleaf of minimal value

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Searching and sorting (68P10) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Postulates for subadditive processes
• The first birth problem for an age-dependent branching process
• Searching for an optimal path in a tree with random costs
• Random Trees and the Analysis of Branch and Bound Procedures
• Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
• The average complexity of depth-first search with backtracking and cutoff
• An Average Time Analysis of Backtracking

This page was built for publication: