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

DOI10.1137/110832689zbMATH Open1245.05021OpenAlexW2569790834MaRDI QIDQ2902900

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

minimum spanning treefinite metric spacesymmetric disk graphwireless communication network

Mathematics Subject Classification ID

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

Related Items (1)

The MST of symmetric disk graphs 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)