scientific article; zbMATH DE number 1263269

MaRDI QIDQ4234142zbMATH OpenFDO

Authors Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl

Publication date 15 September 1999

zbMATH Keywords

bandwidthextreme eigenvaluesLaplacianspectral graph theoryvertex separator

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• A spectral approach to bandwidth and separator problems in graphs
• Bandwidth, vertex separators, and eigenvalue optimization
• On the Quality of Spectral Separators
• On spectral bounds for cutsets

Cited in

(9)

• Optimal linear labelings and eigenvalues of graphs
• Two improved algorithms for envelope and wavefront reduction
• Spectral methods for graph bisection problems.
• Interlacing eigenvalues and graphs
• A projection technique for partitioning the nodes of a graph
• Bandwidth, vertex separators, and eigenvalue optimization
• On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
• A spectral algorithm for envelope reduction of sparse matrices
• A spectral approach to bandwidth and separator problems in graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4234142)