๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method

โœ Scribed by Chan, Tony F.; Ciarlet, P.; Szeto, W. K.

Book ID
118189552
Publisher
Society for Industrial and Applied Mathematics
Year
1997
Tongue
English
Weight
211 KB
Volume
18
Category
Article
ISSN
1064-8275

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

On the signless Laplacian spectral radiu
On the signless Laplacian spectral radius of graphs with cut vertices
โœ Bao-Xuan Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 129 KB

In this paper, we show that among all the connected graphs with n vertices and k cut vertices, the maximal signless Laplacian spectral radius is attained uniquely at the graph G n,k , where G n,k is obtained from the complete graph K n-k by attaching paths of almost equal lengths to all vertices of