Publication:4352274
From MaRDI portal
zbMath0883.05096MaRDI QIDQ4352274
Publication date: 1 March 1998
partitions; semidefinite programming; eigenvalues; eigenvectors; max-cut problem; rapidly mixing Markov chains; isoperimetric properties; Laplacean
90C35: Programming involving graphs or networks
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Semidefinite programming and combinatorial optimization, de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph, Discrete nodal domain theorems, The Laplacian spectrum of a mixed graph, Graphs with fourth Laplacian eigenvalue less than two, On spectral integral variations of mixed graphs, Laplacian eigenvalues and fixed size multisection, Bipartite graphs with small third Laplacian eigenvalue., Lower bounds for the eigenvalues of Laplacian matrices, Graphs and Hermitian matrices: eigenvalue interlacing, Largest eigenvalue of a unicyclic mixed graphs, Eigenvalue bounds on restrictions of reversible nearly uncoupled Markov chains, Fast algorithms for fair dynamic load redistribution in heterogeneous environments, Landscapes on spaces of trees, The Laplacian eigenvalues of mixed graphs, On Cheeger-type inequalities for weighted graphs
