Minimum weight euclidean matching and weighted relative neighborhood graphs

DOI10.1007/3-540-57155-8_275zbMATH Open1504.68180OpenAlexW1510667493MaRDI QIDQ5060141FDOQ5060141

Authors: 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 algorithms (graph-theoretic aspects) (05C85) 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)

Cites Work

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

Cited In (1)

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

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

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