Old Web
English
Sign In
Acemap
>
Paper
>
A Combinatorial Algorithm for Minimizing the Maximum Laplacian Eigenvalue of Weighted Bipartite Graphs
A Combinatorial Algorithm for Minimizing the Maximum Laplacian Eigenvalue of Weighted Bipartite Graphs
2015
Christoph Helmberg
Israel Rocha
Uwe Schwerdtfeger
Keywords:
Laplace operator
Combinatorics
Bipartite graph
Eigenvalues and eigenvectors
combinatorial algorithms
Mathematics
Correction
Source
Cite
Save
Machine Reading By IdeaReader
7
References
0
Citations
NaN
KQI
[]