TREE-WEIGHTED NEIGHBORS AND GEOMETRIC k SMALLEST SPANNING TREES

DOI10.1142/S0218195994000136zbMATH Open0820.68087OpenAlexW2165176404MaRDI QIDQ4312279

David Eppstein

Publication date: 27 August 1995

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195994000136

zbMATH Keywords

geometric optimizationminimum spanning treesspanning tree enumeration

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs 👍 👎
• Weight of 3-paths in sparse plane graphs 👍 👎
• On the spanning trees of weighted graphs 👍 👎
• Geometry of the minimal spanning tree of a random 3-regular graph 👍 👎
• A note on a spanning 3-tree 👍 👎
• On minimum- and maximum-weight minimum spanning trees with neighborhoods 👍 👎
• On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods 👍 👎
• Spanning trees in 3-connected K3,t-minor-free graphs 👍 👎
• Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions 👍 👎
• On tree 3‐spanners in directed path graphs 👍 👎

This page was built for publication: TREE-WEIGHTED NEIGHBORS AND GEOMETRIC k SMALLEST SPANNING TREES