Efficient splitting and merging algorithms for order decomposable problems

DOI10.1007/3-540-63165-8_215zbMATH Open1401.68055OpenAlexW1500139253MaRDI QIDQ4571990FDOQ4571990

Authors: Roberto Grossi, Giuseppe F. Italiano 

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_215

Recommendations

• Efficient splitting and merging algorithms for order decomposable problems.
• Concatenable structures for decomposable problems
• Concatenable segment trees (extended abstract)
• Data structures for mergeable trees
• Priority Search Trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10) Computational aspects related to convexity (52B55)

Cites Work

• Title not available (Why is that?)
• Quad trees: A data structure for retrieval by composite keys
• The design of dynamic data structures
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Maintenance of configurations in the plane
• Title not available (Why is that?)
• Adding range restriction capability to dynamic data structures
• General methods for adding range restrictions to decomposable searching problems
• Decomposable searching problems
• Worst-case optimal insertion and deletion methods for decomposable searching problems
• Dynamic multi-dimensional data structures based on quad- and k-d trees
• Divided \(k-d\) trees
• Decomposable searching problems I. Static-to-dynamic transformation
• Multidimensional binary search trees used for associative searching
• Optimal External Memory Interval Management
• Organization and maintenance of large ordered indexes
• Dynamization of order decomposable set problems
• Optimal dynamization of decomposable searching problems
• Union-copy structures and dynamic segment trees
• Title not available (Why is that?)
• Some principles for dynamizing decomposable searching problems
• Title not available (Why is that?)
• Concatenable structures for decomposable problems
• Title not available (Why is that?)
• Lower bounds on the efficiency of transforming static data structures into dynamic structures

Cited In (3)

• Sequential-Merge Facets for Two-Dimensional Group Problems
• Some optimal algorithms for decomposed partially ordered sets
• Efficient splitting and merging algorithms for order decomposable problems.

This page was built for publication: Efficient splitting and merging algorithms for order decomposable problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571990)