✦ LIBER ✦

$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs

✍ Scribed by Elkin, Michael; Peleg, David

Book ID: 118181139
Publisher: Society for Industrial and Applied Mathematics
Year: 2004
Tongue: English
Weight: 299 KB
Volume: 33
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539701393384

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Constructing sparse spanners for most gr

Constructing sparse spanners for most graphs in higher dimensions

✍ Barun Chandra 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 444 KB

Efficient algorithms for constructing (1

Efficient algorithms for constructing (1+∊,β)-spanners in the distributed and streaming models

✍ Michael Elkin; Jian Zhang 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 384 KB

Existence and Explicit Constructions of

Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q

✍ M. Morgenstern 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 691 KB

For any prime power $q$, we give explicit constructions for many infinite linear families of $q+1$ regular Ramanujan graphs. This partially solves a problem that was raised by A. Lubotzky, R. Phillips, and P. Sarnak. They gave the same results as here, but only for $q$ being prime and not equa

Two construction schemes for cubic hamil

Two construction schemes for cubic hamiltonian 1-node-hamiltonian graphs

✍ Chang-Hsiung Tsai; Tseng-Kui Li 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 698 KB

Finding and defining the generators of g

Finding and defining the generators of genus-n objects for constructing topological and cut graphs

✍ D. Steiner; A. Fischer 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 805 KB