A dynamic separator algorithm

DOI10.1007/3-540-57155-8_240MaRDI QIDQ5060105zbMATH OpenOpenAlexFDO

Authors Deganit Armon, J. 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

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

Recommendations

• scientific article; zbMATH DE number 741006
• Dynamic Point Location in General Subdivisions
• Separators for sphere-packings and nearest neighbor graphs
• scientific article; zbMATH DE number 1617249
• Separator based sparsification. I: Planarity testing and minimum spanning trees

Cites work

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

Cited in

(5)

• Algorithms for finding connected separators between antipodal points
• scientific article; zbMATH DE number 741006 (Why is no real title available?)
• Separators for sphere-packings and nearest neighbor graphs
• scientific article; zbMATH DE number 4114676 (Why is no real title available?)
• Fast separator decomposition for finite element meshes

This page was built for publication: A dynamic separator algorithm

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