The MST of symmetric disk graphs (in arbitrary metric spaces) is light

DOI10.1137/110832689MaRDI QIDQ2902900zbMATH OpenOpenAlexFDO

Authors Shay Solomon

Publication date 22 August 2012

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/54395896425c668aeaf971e010492838b4b90506

zbMATH Keywords

finite metric spaceminimum spanning treesymmetric disk graphwireless communication network

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Metric spaces, metrizability (54E35) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18)

Recommendations

• The MST of symmetric disk graphs (in arbitrary metric spaces) is light
• The MST of symmetric disk graphs is light
• The MST of symmetric disk graphs is light
• The minimal spanning tree and the upper box dimension
• Low-light trees, and tight lower bounds for Euclidean spanners

Cited in

(3)

• The MST of symmetric disk graphs is light
• The MST of symmetric disk graphs is light
• The MST of symmetric disk graphs (in arbitrary metric spaces) is light

This page was built for publication: The MST of symmetric disk graphs (in arbitrary metric spaces) is light

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