Degree-bounded minimum spanning tree for unit disk graph

DOI10.1016/J.TCS.2011.10.019MaRDI QIDQ764345zbMATH OpenOpenAlexFDO

Authors Hongli Xu, Wang Liu, Yindong Zhang, Yanjing Sun, Liusheng 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

necessary conditionwireless sensor networkunit disk graphdegree-bounded minimum spanning tree

Mathematics Subject Classification ID

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

Recommendations

• Degree-bounded minimum spanning trees
• Minimum bottleneck spanning trees with degree bounds
• Approximating the degree-bounded minimum diameter spanning tree problem
• Approximating the degree-bounded minimum diameter spanning tree problem
• Matroidal degree-bounded minimum spanning trees
• Finding bounded diameter minimum spanning tree in general graphs
• Tree spanners of bounded degree graphs
• Approximating minimum bounded degree spanning trees to within one of optimal
• Lower and upper bounds for the degree-constrained minimum spanning tree problem
• scientific article; zbMATH DE number 91018

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2157456 (Why is no real title available?)
• Euclidean bounded-degree spanning tree ratios
• Low-Degree Spanning Trees of Small Weight
• Transitions in geometric minimum spanning trees

Cited in

(3)

• Approximate MST for UDG locally
• Bounded-degree minimum-radius spanning trees in wireless sensor networks
• On the Topologies of Local Minimum Spanning Trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764345)