Skip to main content
Article thumbnail
Location of Repository

A Combinatorial Algorithm for Minimizing the Maximum Laplacian Eigenvalue of Weighted Bipartite Graphs

By Christoph Helmberg, Israel Rocha and Uwe Schwerdtfeger


We give a strongly polynomial time combinatorial algorithm to minimise the largest eigenvalue of the weighted Laplacian of a bipartite graph. This is accomplished by solving the dual graph embedding problem which arises from a semidefinite programming formulation. In particular, the problem for trees can be solved in time cubic in the number of vertices

Topics: Bipartiter Graph, Baum, gewichtete Laplace Matrix, Einbettung von Graphen, bipartite graph, tree, weighted Laplacian matrix, graph embedding, ddc:510, bipartiter Graph, Baum
Publisher: Universit├Ątsbibliothek Chemnitz
Year: 2015
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.