New spectral bounds on k-partitioning of graphs

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 255-262

  Elsasser R ^a   Lucking T ^a   Monien, B ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; COMPUTER SIMULATION; EIGENVALUES AND EIGENFUNCTIONS; FINITE ELEMENT METHOD; GRAPH THEORY;

INTER-PROCESSOR COMMUNICATION;

PARALLEL PROCESSING SYSTEMS;

EID: 0034824322     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. On k-partitioning the n-cube
2. New spectral lower bounds on the bisection width of graphs
3. On partitioning grids into equal parts
4. Spectra, euclidean representations and clusterings of hypergraphs
5. Spectra and optimal partitions of weighted graphs
6. Graph bisection algorithms with good average case behaviour
7. A near optimal algorithm for edge separators
8. Combining helpful sets and parallel simulated annealing for the graph-partitioning problem
9. Lower bounds for the partitioning of graphs
10. A computational study of graph partitioning
11. Some simplified NP-complete graph problems
12. Geometric mesh partitioning: Implementation and experiments
13. On the performance of spectral graph partitioning methods
14. A new lower bound via projection for the quadratic assignment problem
15. The variation of the spectrum of a normal matrix
16. Partitioning sparse matrices with eigenvectors of graphs
17. A projection technique for partitioning the nodes of a graph
18. Spectral partitioning works: Planar graphs and finite element meshes