✦ LIBER ✦

Bisections of graphs

✍ Scribed by Lee, Choongbum; Loh, Po-Shen; Sudakov, Benny

Book ID: 121245631
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 458 KB
Volume: 103
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2013.06.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On judicious bisections of graphs

✍ Xu, Baogang; Yu, Xingxing 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 536 KB

Random Walks, Bisections and Gossiping i

Random Walks, Bisections and Gossiping in Circulant Graphs

✍ Bernard Mans, Igor Shparlinski 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 881 KB

Convex Embeddings and Bisections of 3-Co

Convex Embeddings and Bisections of 3-Connected Graphs1

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

Bisecting sparse random graphs

✍ Malwina J. Luczak; Colin McDiarmid 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB 👁 1 views

Bisection width of transposition graphs

✍ Ladislav Stacho; Imrich Vrt'o 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 894 KB

We prove lower and upper bounds on bisection width of transposition graphs. This class of graphs contains several frequently studied interconnection networks including star graphs and hypercubes. In particular, we prove that the bisection width of the complete transposition graph is of order O(n.n!)

The bisection width of grid graphs

✍ C. H. Papadimitriou, M. Sideri 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 752 KB