A computational study of graph partitioning | Zendy

Julie Falkner | Zendy; Franz Rendl | Zendy; Henry Wolkowicz | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A computational study of graph partitioning

Author(s) -

Julie Falkner,

Franz Rendl,

Henry Wolkowicz

Publication year - 1994

Publication title -

mathematical programming

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 2.358

H-Index - 131

eISSN - 1436-4646

pISSN - 0025-5610

DOI - 10.1007/bf01581147

Subject(s) - mathematics , combinatorics , graph partition , partition (number theory) , disjoint sets , upper and lower bounds , eigenvalues and eigenvectors , graph , discrete mathematics , line graph , mathematical analysis , physics , quantum mechanics

Let G = (N; E) be an edge-weighted undirected graph. The graph partitioning problemis the problem of partitioning the node set N into k disjoint subsets of specified sizes so as tominimize the total weight of the edges connecting nodes in distinct subsets of the partition.We present a numerical study on the use of eigenvalue-based techniques to find upper andlower bounds for this problem. Results for bisecting graphs with up to several thousandnodes are given, and for small graphs some...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research