Pages that link to "Item:Q1194346"
From MaRDI portal
The following pages link to There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees (Q1194346):
Displaying 17 items.
- On plane geometric spanners: a survey and open problems (Q359741) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- Delaunay graphs are almost as good as complete graphs (Q584279) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- Computing a minimum-dilation spanning tree is NP-hard (Q945943) (← links)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- There are planar graphs almost as good as the complete graph (Q1823959) (← links)
- Balancing minimum spanning trees and shortest-path trees (Q1899219) (← links)
- Local routing in sparse and lightweight geometric graphs (Q2134745) (← links)
- On certain geometric properties of the Yao-Yao graphs (Q2436661) (← links)
- Lattice Spanners of Low Degree (Q2795942) (← links)
- Lattice spanners of low degree (Q2821117) (← links)
- EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER (Q4818597) (← links)
- An efficient parallel algorithm for shortest paths in planar layered digraphs (Q5490027) (← links)
- Lower Bounds on the Dilation of Plane Spanners (Q5890540) (← links)
- (Q6065466) (← links)