Solving the Euclidean bottleneck matching problem by k-relative neighborhood graphs
From MaRDI portal
Publication:1194341
DOI10.1007/BF01758842zbMATH Open0748.68081OpenAlexW2065158139MaRDI QIDQ1194341FDOQ1194341
Authors: Chuan Yi Tang, Maw-Shang Chang, R. C. T. Lee 
Publication date: 27 September 1992
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01758842
Recommendations
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
- Approximating the bottleneck plane perfect matching of a point set
- Computing Euclidean bottleneck matchings in higher dimensions
- Computing fair and bottleneck matchings in geometric graphs
- Bottleneck non-crossing matching in the plane
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- The relative neighbourhood graph of a finite planar set
- Title not available (Why is that?)
- Algorithms for two bottleneck optimization problems
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Computing relative neighbourhood graphs in the plane
Cited In (17)
- Matchings in higher-order Gabriel graphs
- Geometry helps in bottleneck matching and related problems
- Computing fair and bottleneck matchings in geometric graphs
- Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
- Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs
- Monochromatic plane matchings in bicolored point set
- Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
- Title not available (Why is that?)
- Structural properties of bichromatic non-crossing matchings
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
- Dynamic Euclidean bottleneck matching
- Faster bottleneck non-crossing matchings of points in convex position
- Approximating the bottleneck plane perfect matching of a point set
- Bottleneck matching in the plane
- Computing Euclidean bottleneck matchings in higher dimensions
- Fast algorithms for computing \(\beta\)-skeletons and their relatives.
- 10-Gabriel graphs are Hamiltonian
This page was built for publication: Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1194341)
