Minimum weight euclidean matching and weighted relative neighborhood graphs

DOI10.1007/3-540-57155-8_275zbMath1504.68180OpenAlexW1510667493MaRDI QIDQ5060141

Andy Mirzaian

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_275

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Fast algorithms for computing \(\beta\)-skeletons and their relatives.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• A sweepline algorithm for Voronoi diagrams
• The relative neighbourhood graph of a finite planar set
• Geometry Helps in Matching
• Intersection and Closest-Pair Problems for a Set of Planar Discs
• An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
• Efficient algorithms for finding maximum matching in graphs
• Fibonacci heaps and their uses in improved network optimization algorithms
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Minimum weight euclidean matching and weighted relative neighborhood graphs