Additive weights of a special class of nonuniformly distributed backtrack trees

DOI10.1016/0020-0190(92)90092-AzbMath0780.68068OpenAlexW2075140136WikidataQ127217882 ScholiaQ127217882MaRDI QIDQ1198027

Uwe Trier

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90092-a

zbMATH Keywords

average case analysis of algorithmsbacktrack trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (2)

On the average number of registers needed to evaluate a special class of backtrack trees ⋮ Uniformly growing backtrack trees

Cites Work

• The expected additive weight of trees
• Tree Size by Partial Backtracking
• On the Altitude of Nodes in Random Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Additive weights of a special class of nonuniformly distributed backtrack trees