✦ LIBER ✦

Cuts, Trees and ℓ1-Embeddings of Graphs*

✍ Scribed by Anupam Gupta†; Ilan Newman; Yuri Rabinovich; Alistair Sinclair‡

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

In-trees and plane embeddings of outerpl

✍ Maciej M. Sysło; Pawel Winter 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 398 KB

Embeddings of bipartite graphs

✍ Mohammed Abu-Sbeih; T. D. Parsons 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 458 KB

Embedding Complete Binary Trees into Sta

✍ A. Bouabdallah; M. C. Heydemann; J. Opatrny; D. Sotteau 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 532 KB

Constant Approximation Algorithms for Em

✍ V. Chepoi; F. F. Dragan; I. Newman; Y. Rabinovich; Y. Vaxès 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 887 KB

Convex Embeddings and Bisections of 3-Co

✍ Hiroshi Nagamochi; Tibor Jordán; Yoshitaka Nakao; Toshihide Ibaraki 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 284 KB

Embeddings and Other Mappings of Rooted

✍ Nicholas Georgiou 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 450 KB