Pages that link to "Item:Q1194341"
From MaRDI portal
The following pages link to Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs (Q1194341):
Displayed 14 items.
- Higher-order triangular-distance Delaunay graphs: graph-theoretical properties (Q904106) (← links)
- Approximating the bottleneck plane perfect matching of a point set (Q904112) (← links)
- Computing Euclidean bottleneck matchings in higher dimensions (Q1607062) (← links)
- Structural properties of bichromatic non-crossing matchings (Q2247147) (← links)
- Monochromatic plane matchings in bicolored point set (Q2338213) (← links)
- Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs (Q2338215) (← links)
- 10-Gabriel graphs are Hamiltonian (Q2353639) (← links)
- Optimal point movement for covering circular regions (Q2354019) (← links)
- Matchings in higher-order Gabriel graphs (Q2355704) (← links)
- Faster bottleneck non-crossing matchings of points in convex position (Q2401333) (← links)
- PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (Q5300005) (← links)
- (Q5881545) (← links)
- Fast algorithms for computing \(\beta\)-skeletons and their relatives. (Q5948530) (← links)
- Bottleneck matching in the plane (Q6103175) (← links)