Incremental hive graph

DOI10.1007/3-540-60618-1_65OpenAlexW33910237MaRDI QIDQ6122211

Roberto Giaccio, Fabrizio d'Amore

Publication date: 28 February 2024

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

Full work available at URL: https://doi.org/10.1007/3-540-60618-1_65

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Cites Work

• Linear space data structures for two types of range search
• An incremental reconstruction method for dynamic planar point location
• Dynamic planar point location with optimal query time
• Bounded ordered dictionaries in O(log log N) time and O(n) space
• A theory of rectangular dual graphs
• Preserving order in a forest in less than logarithmic time and linear space
• Log-logarithmic worst-case range queries are possible in space theta(N)
• Filtering Search: A New Approach to Query-Answering
• New Results on Dynamic Planar Point Location

This page was built for publication: Incremental hive graph