✦ LIBER ✦

Grid spanners

✍ Scribed by Arthur L. Liestman; Thomas C. Shermer

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 837 KB
Volume: 23
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230230206

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graph spanners

✍ David Peleg; Alejandro A. Schäffer 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 816 KB

Given a graph G = (V E), a subgraph G' = (V E ' ) is a t-spanner of G if for every u, u E V the distance from u to u in G' is at most t times longer than that distance in G. This paper presents some results concerning the existence and efficient constructability of sparse spanners for various classe

Network flow spanners

✍ Feodor F. Dragan; Chenyu Yan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

Degree-Constrained Pyramid Spanners

✍ D. Richards; A.L. Liestman 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 401 KB

A \(t\)-spanner of a pyramid network is a subnetwork in which every two nodes that were connected by an edge in the original pyramid can be connected by a path in the subnetwork with at most \(t\) edges. We give several results that present trade-offs between \(t\) and the maximum degree of a \(t\)-

Generating Sparse 2-Spanners

✍ G. Kortsarz; D. Peleg 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 510 KB

A \(k\)-spanner of a connected graph \(G=(V, E)\) is a subgraph \(G^{\prime}\) consisting of all the vertices of \(V\) and a subset of the edges, with the additional property that the distance between any two vertices in \(G^{\prime}\) is larger than that distance in \(G\) by no more than a factor o

New range of spanners

✍ P Isaacs Ltd J 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 168 KB

Kinetic Spanners in ℝd

✍ Mohammad Ali Abam; Mark de Berg 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 550 KB