Lower Bounds for the Partitioning of Graphs
From MaRDI portal
Publication:5675744
DOI10.1147/rd.175.0420zbMath0259.05112WikidataQ105584808 ScholiaQ105584808MaRDI QIDQ5675744
Publication date: 1973
Published in: IBM Journal of Research and Development (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1147/rd.175.0420
05C35: Extremal problems in graph theory
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
05C99: Graph theory
Related Items
Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée, An Algorithm for Partitioning the Nodes of a Graph, A survey of graph laplacians, Semidefinite programming and combinatorial optimization, The performance of an eigenvalue bound on the max-cut problem in some classes of graphs, \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators, Spectral partitioning works: planar graphs and finite element meshes, Grouping of parts and components in flexible manufacturing systems, Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality, Optimal partitions having disjoint convex and conic hulls, Spectral partitioning with multiple eigenvectors, Path optimization for graph partitioning problems, A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix, Laplacian eigenvalues and the maximum cut problem, A computational study of graph partitioning, On minimizing the largest eigenvalue of a symmetric matrix, Spectral methods for graph bisection problems., Best ellipsoidal relaxation to solve a nonconvex problem., Laplacian eigenvalues and fixed size multisection, Generating irregular partitionable data structures, Algorithms for graph partitioning problems by means of eigenspace relaxations, Heuristics for semirandom graph problems, Solving the max-cut problem using eigenvalues, A projection technique for partitioning the nodes of a graph, Lower bounds for the quadratic assignment problem via triangle decompositions, Semidefinite programming relaxations for the graph partitioning problem, A survey of kernel and spectral methods for clustering, Consistency of spectral clustering, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, Local and global approaches of affinity propagation clustering for large scale data, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, Spectral clustering based on matrix perturbation theory, The optimal partitioning of networks
