Pages that link to "Item:Q904112"
From MaRDI portal
The following pages link to Approximating the bottleneck plane perfect matching of a point set (Q904112):
Displaying 14 items.
- Bottleneck non-crossing matching in the plane (Q390164) (← links)
- Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs (Q1194341) (← links)
- Euclidean bottleneck bounded-degree spanning tree ratios (Q2066315) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Monochromatic plane matchings in bicolored point set (Q2338213) (← links)
- Matchings in higher-order Gabriel graphs (Q2355704) (← links)
- Faster bottleneck non-crossing matchings of points in convex position (Q2401333) (← links)
- Geometric planar networks on bichromatic collinear points (Q2664940) (← links)
- Crossing-Free Perfect Matchings in Wheel Point Sets (Q4604397) (← links)
- Connecting the dots (with minimum crossings) (Q5088932) (← links)
- A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates (Q5174455) (← links)
- Plane and planarity thresholds for random geometric graphs (Q5216443) (← links)
- Planar Bichromatic Bottleneck Spanning Trees (Q5874461) (← links)
- Dynamic Euclidean bottleneck matching (Q6612538) (← links)