Lower Bounds for the Partitioning of Graphs
From MaRDI portal
Publication:5675744
DOI10.1147/rd.175.0420zbMath0259.05112OpenAlexW2033852356WikidataQ105584808 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
Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph theory (05C99)
Related Items
Grouping of parts and components in flexible manufacturing systems, A review on spectral clustering and stochastic block models, A computational study of graph partitioning, Non-asymptotic properties of spectral decomposition of large Gram-type matrices and applications, On minimizing the largest eigenvalue of a symmetric matrix, On the multiplicity of Laplacian eigenvalues and Fiedler partitions, Bayesian degree-corrected stochastic blockmodels for community detection, Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée, A survey of kernel and spectral methods for clustering, Solving the max-cut problem using eigenvalues, The optimal partitioning of networks, General Cheeger inequalities for \(p\)-Laplacians on graphs, A projection technique for partitioning the nodes of a graph, Spectral clustering based on matrix perturbation theory, Improvements on Spectral Bisection, Lower bounds for the quadratic assignment problem via triangle decompositions, Spectral partitioning works: planar graphs and finite element meshes, Complex networks: structure and dynamics, Graph-based point drift: graph centrality on the registration of point-sets, Semidefinite approximations for quadratic programs over orthogonal matrices, A survey of graph laplacians, Bound and exact methods for assessing link vulnerability in complex networks, Spectral bisection with two eigenvectors, Fast density-weighted low-rank approximation spectral clustering, Partitioning through projections: strong SDP bounds for large graph partition problems, New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph, Consistency of spectral clustering, Complex Hadamard diagonalisable graphs, Spectral methods for graph bisection problems., Commute times for a directed graph using an asymmetric Laplacian, An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem, Multiway spectral clustering: a margin-based perspective, Best ellipsoidal relaxation to solve a nonconvex problem., Fast semi-supervised clustering with enhanced spectral embedding, Laplacian eigenvalues and fixed size multisection, Semidefinite programming relaxations for the graph partitioning problem, Spectral clustering and the high-dimensional stochastic blockmodel, Employee workload balancing by graph partitioning, Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer, Metric uniformization and spectral bounds for graphs, Diffusion bank networks and capital flows, A divisive spectral method for network community detection, Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality, Optimal partitions having disjoint convex and conic hulls, The MIN-cut and vertex separator problem, Topological graph clustering with thin position, The performance of an eigenvalue bound on the max-cut problem in some classes of graphs, Contribution of copositive formulations to the graph partitioning problem, Semidefinite programming and combinatorial optimization, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, QCC: a novel clustering algorithm based on quasi-cluster centers, Spectral methods for graph clustering - a survey, SDP Relaxations for Some Combinatorial Optimization Problems, A hybrid artificial immune network for detecting communities in complex networks, Local and global approaches of affinity propagation clustering for large scale data, Evaluating performance of image segmentation criteria and techniques, Detection of structurally homogeneous subsets in graphs, Convex programming based spectral clustering, Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs, A new barrier for a class of semidefinite problems, Discrepancy and eigenvalues of Cayley graphs, Spectral partitioning with multiple eigenvectors, Path optimization for graph partitioning problems, Spectral clustering revisited: information hidden in the Fiedler vector, Generating irregular partitionable data structures, Unnamed Item, Algorithms for graph partitioning problems by means of eigenspace relaxations, FINDING COMMUNITY STRUCTURE IN SPATIAL MARITIME SHIPPING NETWORKS, Spectral bounds for graph partitioning with prescribed partition sizes, An Algorithm for Partitioning the Nodes of a Graph, Partitioning networks into clusters and residuals with average association, Unnamed Item, Scalable module detection for attributed networks with applications to breast cancer, \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators, The geometry of kernelized spectral clustering, A New Lower Bound on the Size of the Smallest Vertex Separator of a Graph, Partitions of networks that are robust to vertex permutation dynamics, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix, Semidefinite programming and eigenvalue bounds for the graph partition problem, Heuristics for semirandom graph problems, Laplacian eigenvalues and the maximum cut problem, Role of normalization in spectral clustering for stochastic blockmodels, Data clustering based on the modified relaxation Cheeger cut model, Column-generation based bounds for the homogeneous areas problem
