✦ LIBER ✦

The Compactness of Interval Routing for Almost All Graphs

✍ Scribed by Gavoille, Cyril; Peleg, David

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Compactness of Interval Routing

✍ Gavoille, Cyril; Peleg, David 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 338 KB

On the chromatic index of almost all gra

✍ P Erdős; Robin J Wilson 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 149 KB

Space-efficient Routing Tables for Almos

✍ Buhrman, Harry; Hoepman, Jaap-Henk; Vitányi, Paul 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 366 KB

On the number of paths and cycles for al

✍ I. Tomescu 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 265 KB

On the number of maximum genus embedding

✍ Saul Stahl 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 642 KB

A Compactness Criterion for the Space of

✍ F. Jeschek; H. Poppe; A. Stärk 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB