Pages that link to "Item:Q1186079"
From MaRDI portal
The following pages link to Classes of graphs which approximate the complete Euclidean graph (Q1186079):
Displayed 24 items.
- Ordered theta graphs (Q598550) (← links)
- A generalized hypergreedy algorithm for weighted perfect matching (Q688623) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- I/O-efficient algorithms for computing planar geometric spanners (Q929749) (← links)
- Bounds for the CRDT conformal mapping algorithm (Q977103) (← links)
- Empty region graphs (Q1000919) (← links)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- Approximating Euclidean distances by small degree graphs (Q1317879) (← links)
- Euclidean spanner graphs with degree four (Q1336638) (← links)
- A fast algorithm for approximating the detour of a polygonal chain. (Q1428113) (← links)
- Approximating geometric bottleneck shortest paths (Q1886239) (← links)
- Sigma-local graphs (Q2266933) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- Local properties of geometric graphs (Q2456666) (← links)
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation (Q2489546) (← links)
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces (Q3057631) (← links)
- Geometric Spanner of Objects under L 1 Distance (Q3511351) (← links)
- Spanners of Additively Weighted Point Sets (Q3512473) (← links)
- Computing the Greedy Spanner in Near-Quadratic Time (Q3512475) (← links)
- DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE (Q3636312) (← links)
- EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION (Q5297793) (← links)
- A GEOMETRIC SPANNER OF SEGMENTS (Q5305063) (← links)
- Geometric Spanner of Segments (Q5387747) (← links)
- A simple and efficient kinetic spanner (Q5902230) (← links)