𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Analysis of the worst case space complexity of a PR quadtree

✍ Scribed by Sriram V. Pemmaraju; Clifford A. Shaffer

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
407 KB
Volume
49
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Exact Worst Case Query Complexity
On the Exact Worst Case Query Complexity of Planar Point Location
✍ Raimund Seidel; Udo Adamy πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 241 KB

What is the smallest constant c so that the planar point location queries can be Ž . Ž . answered in c log n q o log n steps i.e., point᎐line comparisons in the worst 2 Ž case? M. T. Goodrich, M. Orletsky, and K. Ramaiyer 1997, in ''Proc 8th ACM-Ž . . SIAM Symp on Discrete Algorithms SODA ,'' pp. 75

Worst case analysis of a greedy algorith
Worst case analysis of a greedy algorithm for graph thickness
✍ Sinichiro Kawano; Koichi Yamazaki πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 208 KB

In this paper, we consider a greedy algorithm for thickness of graphs. The greedy algorithm we consider here takes a maximum planar subgraph away from the current graph in each iteration and repeats this process until the current graph has no edge. The greedy algorithm outputs the number of iteratio