A spectral approach to bandwidth and separator problems in graphs

13 years 5 months ago

Download www-user.tu-chemnitz.de

Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The bounds are based on a projection technique developed for the quadratic assignment problem, and once more demonstrate the importance of the extreme eigenvalues of the Laplacian. They will be shown to be strict for certain classes of graphs and compare favourably to bounds already known in literature. Further improvement is gained by applying nonlinear optimization methods.

Christoph Helmberg, Bojan Mohar, Svatopluk Poljak,

Real-time Traffic

General Undirected Graphs | IPCO 1993 | IPCO 2007 | Largest Common Subgraph | Lower Bounds |

claim paper

» Graph Searching Elimination Trees and a Generalization of Bandwidth

» Blind Onemicrophone Speech Separation A Spectral Learning Approach

» Weighted Graph Cuts without Eigenvectors A Multilevel Approach

» A survey of kernel and spectral methods for clustering

» Blind SpectralGMM Estimation for Underdetermined Instantaneous Audio Source Separation

» Coclustering documents and words using bipartite spectral graph partitioning

» Isoperimetric Graph Partitioning for Image Segmentation

» Multiclass spectral clustering based on discriminant analysis

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1993
Where	IPCO
Authors	Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl

Comments (0)

Sciweavers

A spectral approach to bandwidth and separator problems in graphs

General Undirected Graphs | IPCO 1993 | IPCO 2007 | Largest Common Subgraph | Lower Bounds |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers