Degree-bounded minimum spanning tree for unit disk graph

DOI10.1016/j.tcs.2011.10.019zbMath1236.68014OpenAlexW2060773570MaRDI QIDQ764345

Yanjing Sun, Hongli Xu, Yindong Zhang, Wang Liu, Liu-sheng Huang

Publication date: 13 March 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.10.019

zbMATH Keywords

wireless sensor networknecessary conditionunit disk graphdegree-bounded minimum spanning tree

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Cites Work

• Transitions in geometric minimum spanning trees
• Euclidean bounded-degree spanning tree ratios
• A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
• Low-Degree Spanning Trees of Small Weight
• Unnamed Item
• Unnamed Item

This page was built for publication: Degree-bounded minimum spanning tree for unit disk graph