Pages that link to "Item:Q2482197"
From MaRDI portal
The following pages link to Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197):
Displaying 22 items.
- Linear time algorithm for optimal feed-link placement (Q482338) (← links)
- Distribution-sensitive construction of the greedy spanner (Q527422) (← links)
- Bottleneck detour tree of points on a path (Q670710) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- Geometric dilation of closed curves in normed planes (Q1005328) (← links)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- Approximating the packedness of polygonal curves (Q2088893) (← links)
- Most finite point sets in the plane have dilation \(>1\) (Q2256585) (← links)
- Classical curve theory in normed planes (Q2396289) (← links)
- Lattice Spanners of Low Degree (Q2795942) (← links)
- Lattice spanners of low degree (Q2821117) (← links)
- COMPUTING THE MAXIMUM DETOUR OF A PLANE GEOMETRIC GRAPH IN SUBQUADRATIC TIME (Q2968072) (← links)
- (Q3619930) (← links)
- COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE (Q4650090) (← links)
- Testing Euclidean Spanners (Q4933382) (← links)
- On the Stretch Factor of Polygonal Chains (Q5001847) (← links)
- (Q5092418) (← links)
- DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES (Q5305064) (← links)
- Lower Bounds on the Dilation of Plane Spanners (Q5890540) (← links)
- Approximating the Packedness of Polygonal Curves (Q6065398) (← links)
- Bounded-degree plane geometric spanners in practice (Q6579765) (← links)
