The MST of symmetric disk graphs is light

DOI10.1016/J.COMGEO.2011.08.002zbMath1242.05054OpenAlexW2085662734MaRDI QIDQ425622

Paz Carmi, A. Karim Abu-Affash, Matthew J. Katz, Rom Aschner

Publication date: 8 June 2012

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.08.002

zbMATH Keywords

MSTgap theoremsymmetric disk graphwireless communication network

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On sparse spanners of weighted graphs
• Power consumption in packet radio networks
• Geometric Spanner Networks
• The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
• NEW SPARSENESS RESULTS ON GRAPH SPANNERS

This page was built for publication: The MST of symmetric disk graphs is light