On spectral bounds for the \(k\)-partitioning of graphs

DOI10.1007/s00224-003-1083-9zbMath1101.68067OpenAlexW2041273373MaRDI QIDQ1879186

Robert Elsässer, Thomas Lücking, Burkhard Monien

Publication date: 22 September 2004

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-003-1083-9

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

New spectral lower bounds on the bisection width of graphs

Uses Software

• MESHPART

This page was built for publication: On spectral bounds for the \(k\)-partitioning of graphs