scientific article; zbMATH DE number 510844
From MaRDI portal
Publication:4281312
zbMath0806.90104MaRDI QIDQ4281312
Publication date: 19 February 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyrankingclusteringeigenvalueseigenvectorsdiametermaximum cutconnectivityquadratic assignmentscalinggraph bisectionchromatic numberseparationmean distancerandom walks on graphsgraph partitionpartition problemsisoperimetric numbersroutingsmaximum stable setsmin-\(p\)-sum problems
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (43)
iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big data ⋮ Graph Laplacians, nodal domains, and hyperplane arrangements ⋮ Spectral properties of unimodular lattice triangulations ⋮ The algebraic connectivity of graphs with given circumference ⋮ Solving the max-cut problem using eigenvalues ⋮ Upper bounds on algebraic connectivity via convex optimization ⋮ Semidefinite programming in combinatorial optimization ⋮ The Maximum k-Colorable Subgraph Problem and Related Problems ⋮ Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs ⋮ A spectral algorithm for envelope reduction of sparse matrices ⋮ Matrix power inequalities and the number of walks in graphs ⋮ Unnamed Item ⋮ On graphs whose Laplacian index does not exceed 4.5 ⋮ Graph spectra in computer science ⋮ Spectral methods for graph bisection problems. ⋮ The smallest Laplacian spectral radius of graphs with a given clique number ⋮ A novel neural network for solving semidefinite programming problems with some applications ⋮ Large regular bipartite graphs with median eigenvalue 1 ⋮ Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra ⋮ On Laplacian spectra of parametric families of closely connected networks with application to cooperative control ⋮ Unnamed Item ⋮ A probabilistic result for the max-cut problem on random graphs ⋮ Semidefinite programming and combinatorial optimization ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ Potential energy principles in networked systems and their connections to optimization problems on graphs ⋮ The Laplacian spectral radius for unicyclic graphs with given independence number ⋮ Gonality of expander graphs ⋮ The Laplacian spectral radius of a graph under perturbation ⋮ Some results on the Laplacian eigenvalues of unicyclic graphs ⋮ On the N-spectrum of oriented graphs ⋮ Exact bounds on the order of the maximum clique of a graph. ⋮ The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum ⋮ A CONTINUATION APPROACH USING NCP FUNCTION FOR SOLVING MAX-CUT PROBLEM ⋮ Average distance in graphs and eigenvalues ⋮ Sherali-adams strikes back ⋮ Unnamed Item ⋮ On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\) ⋮ Bounds for the Laplacian spectral radius of graphs ⋮ Unnamed Item ⋮ On maximum signless Laplacian Estrada index of graphs with given parameters II ⋮ Semidefinite programming and eigenvalue bounds for the graph partition problem ⋮ Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem ⋮ Laplacian matrices of graphs: A survey
This page was built for publication:
