A dynamic separator algorithm

DOI10.1007/3-540-57155-8_240zbMath1504.68246OpenAlexW1760870166MaRDI QIDQ5060105

Deganit Armon, John H. Reif

Publication date: 18 January 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Cites Work

• The design of dynamic data structures
• An O(n log n) algorithm for the all-nearest-neighbors problem
• Fast and efficient solution of path algebra problems
• A Separator Theorem for Planar Graphs
• Planar graph decomposition and all pairs shortest paths

This page was built for publication: A dynamic separator algorithm