Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs
DOI10.1137/15M1034854zbMath1365.05175OpenAlexW2625857725MaRDI QIDQ5268000
Christoph Helmberg, Israel Rocha, Uwe Schwerdtfeger
Publication date: 14 June 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1034854
Programming involving graphs or networks (90C35) Trees (05C05) Semidefinite programming (90C22) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Minimum spectral radius of a weighted graph
- An extremal problem for the spectral radius of a graph
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Bipartite subgraphs and the signless Laplacian matrix
- The rotational dimension of a graph
- The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
- Embedded in the Shadow of the Separator
- Towards a spectral theory of graphs based on the signless Laplacian, I
- A characterization of the smallest eigenvalue of a graph
- Fastest Mixing Markov Chain on a Graph
- A minimax problem for graphs and its relation to generalized doubly stochastic matrices
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Max Cut and the Smallest Eigenvalue
This page was built for publication: Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs
