𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Spanners and Lightweight Spanners of Geometric Graphs

✍ Scribed by Kanj, Iyad A.; Perković, Ljubomir; Xia, Ge

Book ID
118181071
Publisher
Society for Industrial and Applied Mathematics
Year
2010
Tongue
English
Weight
369 KB
Volume
39
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spanners of Complete k -Partite Geometri
Spanners of Complete k -Partite Geometric Graphs
✍ Bose, Prosenjit; Carmi, Paz; Couture, Mathieu; Maheshwari, Anil; Morin, Pat; Smi 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 259 KB
Tree spanners on chordal graphs: complex
Tree spanners on chordal graphs: complexity and algorithms
✍ Andreas Brandstädt; Feodor F. Dragan; Hoàng-Oanh Le; Van Bang Le 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 329 KB

A tree t-spanner T in a graph G is a spanning tree of G such that the distance in T between every pair of vertices is at most t times their distance in G. The TREE t-SPANNER problem asks whether a graph admits a tree t-spanner, given t. We substantially strengthen the hardness result of Cai and Corn

Fault Tolerant Spanners for General Grap
Fault Tolerant Spanners for General Graphs
✍ Chechik, S.; Langberg, M.; Peleg, D.; Roditty, L. 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 306 KB