The MST of symmetric disk graphs is light

DOI10.1007/978-3-642-13731-0_23MaRDI QIDQ3569894zbMATH OpenOpenAlexFDO

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

Publication date 22 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13731-0_23

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18)

Recommendations

• The MST of symmetric disk graphs is light
• The MST of symmetric disk graphs (in arbitrary metric spaces) is light
• The MST of symmetric disk graphs (in arbitrary metric spaces) is light
• Approximate MST for UDG locally
• Minimum spanning trees of random geometric graphs with location dependent weights

Cited in

(3)

• The MST of symmetric disk graphs is light
• The MST of symmetric disk graphs (in arbitrary metric spaces) 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 is light

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