✦ LIBER ✦

On Spectral Bounds for thek-Partitioning of Graphs

✍ Scribed by Robert Elsässer; Thomas Lücking; Burkhard Monien

Publisher: Springer
Year: 2003
Tongue: English
Weight: 238 KB
Volume: 36
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-003-1083-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exact Bounds for Judicious Partitions of

Exact Bounds for Judicious Partitions of Graphs

✍ B. Bollobás; A. D. Scott 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 223 KB

Bounds on the (Laplacian) spectral radiu

Bounds on the (Laplacian) spectral radius of graphs

✍ Lingsheng Shi 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 181 KB

Sharp upper bounds on the spectral radiu

Sharp upper bounds on the spectral radius of graphs

✍ Jinlong Shu; Yarong Wu 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 176 KB

Judicious partitions of bounded-degree g

Judicious partitions of bounded-degree graphs

✍ B. Bollobás; A. D. Scott 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 1 views

## Abstract We prove results on partitioning graphs __G__ with bounded maximum degree. In particular, we provide optimal bounds for bipartitions __V__(__G__) = __V__~1~ ∪ __V__~2~ in which we minimize {__e__(__V__~1~), __e__(__V__~2~)}. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 131–143, 200

Partitioning Graphs of Bounded Tree-Widt

Partitioning Graphs of Bounded Tree-Width

✍ Guoli Ding; Bogdan Oporowski; Daniel P. Sanders; Dirk Vertigan 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 199 KB

A conjugate gradient method for the spec

A conjugate gradient method for the spectral partitioning of graphs

✍ N.P. Kruyt 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 615 KB

The partitioning of graphs is a frequently occurring problem in science and engineering. The spectral graph partitioning method is a promising heuristic method for this class of problems. Its main disadvantage is the large computing time required to solve a special eigenproblem. Here a simple and ef