On paths in search or decision trees which require almost worst-case time

DOI10.1007/3-540-50728-0_59MaRDI QIDQ6199478

Ulrich Huckenbeck

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38)

Cites Work

• On the complexity of convex hull algorithms if rotational minima can be found very fast
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On paths in search or decision trees which require almost worst-case time