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):
Displayed 6 items.
- 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)
- Balancing minimum spanning trees and shortest-path trees (Q1899219) (← 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)