Cited in
(93)- Partitioning through projections: strong SDP bounds for large graph partition problems
- A new lower bound on the size of the smallest vertex separator of a graph
- Local and global approaches of affinity propagation clustering for large scale data
- Cuts, cats, and complete graphs
- The MIN-cut and vertex separator problem
- Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer
- QCC: a novel clustering algorithm based on quasi-cluster centers
- On minimizing the largest eigenvalue of a symmetric matrix
- Fast density-weighted low-rank approximation spectral clustering
- Spectral methods for graph clustering - a survey
- Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks
- A review on spectral clustering and stochastic block models
- A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix
- Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality
- Spectral methods for graph bisection problems.
- Solving the max-cut problem using eigenvalues
- A projection technique for partitioning the nodes of a graph
- Semidefinite programming relaxations for the graph partitioning problem
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
- Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs
- Data clustering based on the modified relaxation Cheeger cut model
- Diffusion bank networks and capital flows
- A new barrier for a class of semidefinite problems
- Topological graph clustering with thin position
- Scalable module detection for attributed networks with applications to breast cancer
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Spectral clustering based on matrix perturbation theory
- Heuristics for semirandom graph problems
- Complex networks: structure and dynamics
- Greedy recursive spectral bisection for modularity-bound hierarchical divisive community detection
- Spectral partitioning with multiple eigenvectors
- Clustering with minimum spanning trees: how good can it be?
- Partitions of networks that are robust to vertex permutation dynamics
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- Best ellipsoidal relaxation to solve a nonconvex problem.
- Optimal partitions having disjoint convex and conic hulls
- Spectral bounds for graph partitioning with prescribed partition sizes
- Consistency of spectral clustering
- Enhancing Markowitz's portfolio selection paradigm with machine learning
- A computational study of graph partitioning
- Spectral bisection with two eigenvectors
- Non-asymptotic properties of spectral decomposition of large Gram-type matrices and applications
- New bounds for the -k-cut and chromatic number of a graph
- An Algorithm for Partitioning the Nodes of a Graph
- Fast semi-supervised clustering with enhanced spectral embedding
- Convex programming based spectral clustering
- Complex Hadamard diagonalisable graphs
- Laplacian eigenvalues and the maximum cut problem
- Semidefinite approximations for quadratic programs over orthogonal matrices
- Bayesian degree-corrected stochastic blockmodels for community detection
- On \(r\)-to-\(p\) norms of random matrices with nonnegative entries: asymptotic normality and \(\ell_{\infty}\)-bounds for the maximizer
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Laplacian eigenvalues and fixed size multisection
- Lower bounds for the quadratic assignment problem via triangle decompositions
- Path optimization for graph partitioning problems
- Evaluating performance of image segmentation criteria and techniques
- Detection of structurally homogeneous subsets in graphs
- Column-generation based bounds for the homogeneous areas problem
- Semidefinite programming and combinatorial optimization
- Bound and exact methods for assessing link vulnerability in complex networks
- Employee workload balancing by graph partitioning
- On the multiplicity of Laplacian eigenvalues and Fiedler partitions
- The geometry of kernelized spectral clustering
- Multi-objective k-way parallel hypergraph partitioning with proximal gradient algorithm
- A divisive spectral method for network community detection
- Discrepancy and eigenvalues of Cayley graphs
- Multiway spectral clustering: a margin-based perspective
- Spectral partitioning works: planar graphs and finite element meshes
- General Cheeger inequalities for p-Laplacians on graphs
- Contribution of copositive formulations to the graph partitioning problem
- Metric uniformization and spectral bounds for graphs
- A survey of kernel and spectral methods for clustering
- Graph-based point drift: graph centrality on the registration of point-sets
- Finding community structure in spatial maritime shipping networks
- SDP relaxations for some combinatorial optimization problems
- A hybrid artificial immune network for detecting communities in complex networks
- Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- A survey of graph laplacians
- Spectral clustering and the high-dimensional stochastic blockmodel
- Grouping of parts and components in flexible manufacturing systems
- Role of normalization in spectral clustering for stochastic blockmodels
- Scalable Clustering: Large Scale Unsupervised Learning of Gaussian Mixture Models with Outliers
- Partitioning networks into clusters and residuals with average association
- An efficient semidefinite programming relaxation for the graph partition problem
- The optimal partitioning of networks
- Spectral clustering revisited: information hidden in the Fiedler vector
- Improvements on spectral bisection
- $k$-partitioned fuzzy graph
- Commute times for a directed graph using an asymmetric Laplacian
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- Generating irregular partitionable data structures
- Algorithms for graph partitioning problems by means of eigenspace relaxations
This page was built for publication: Lower Bounds for the Partitioning of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5675744)
