Pages that link to "Item:Q4507380"
From MaRDI portal
The following pages link to Approximating the Stretch Factor of Euclidean Graphs (Q4507380):
Displayed 19 items.
- Linear time algorithm for optimal feed-link placement (Q482338) (← links)
- Distribution-sensitive construction of the greedy spanner (Q527422) (← links)
- Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) (Q621930) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- Minimum dilation stars (Q871060) (← links)
- Thresholding random geometric graph properties motivated by ad hoc sensor networks (Q988583) (← links)
- A fast algorithm for approximating the detour of a polygonal chain. (Q1428113) (← links)
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation (Q2489546) (← links)
- Deformable spanners and applications (Q2507157) (← links)
- Connect the Dot: Computing Feed-Links with Minimum Dilation (Q3183440) (← links)
- COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE (Q4650090) (← links)
- Testing Euclidean Spanners (Q4933382) (← links)
- LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS (Q5189993) (← links)
- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs (Q5302070) (← links)
- DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES (Q5305064) (← links)
- Dilation-Optimal Edge Deletion in Polygonal Cycles (Q5387748) (← links)
- Many distances in planar graphs (Q5920250) (← links)