Lower Bounds for the Partitioning of Graphs

Cited in

(93)

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
On the multiplicity of Laplacian eigenvalues and Fiedler partitions
Graph-based point drift: graph centrality on the registration of point-sets
Spectral bisection with two eigenvectors
Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer
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
QCC: a novel clustering algorithm based on quasi-cluster centers
Convex programming based spectral clustering
Spectral clustering revisited: information hidden in the Fiedler vector
Data clustering based on the modified relaxation Cheeger cut model
A review on spectral clustering and stochastic block models
Non-asymptotic properties of spectral decomposition of large Gram-type matrices and applications
Complex Hadamard diagonalisable graphs
Diffusion bank networks and capital flows
Topological graph clustering with thin position
Dirichlet $p$-Laplacian eigenvalues and Cheeger constants on symmetric graphs
Spectral bounds for graph partitioning with prescribed partition sizes
The geometry of kernelized spectral clustering
Partitions of networks that are robust to vertex permutation dynamics
Semidefinite programming and eigenvalue bounds for the graph partition problem
Role of normalization in spectral clustering for stochastic blockmodels
Column-generation based bounds for the homogeneous areas problem
A survey of kernel and spectral methods for clustering
Complex networks: structure and dynamics
Consistency of spectral clustering
Commute times for a directed graph using an asymmetric Laplacian
Employee workload balancing by graph partitioning
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
A hybrid artificial immune network for detecting communities in complex networks
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
SDP relaxations for some combinatorial optimization problems
Discrepancy and eigenvalues of Cayley graphs
Finding community structure in spatial maritime shipping networks
An efficient semidefinite programming relaxation for the graph partition problem
Bayesian degree-corrected stochastic blockmodels for community detection
A divisive spectral method for network community detection
General Cheeger inequalities for p-Laplacians on graphs
A new barrier for a class of semidefinite problems
The optimal partitioning of networks
Bound and exact methods for assessing link vulnerability in complex networks
Fast density-weighted low-rank approximation spectral clustering
Fast semi-supervised clustering with enhanced spectral embedding
Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
Scalable kernel $k$-means clustering with Nyström approximation: relative-error bounds
An Algorithm for Partitioning the Nodes of a Graph
A survey of graph laplacians
Contribution of copositive formulations to the graph partitioning problem
Improvements on spectral bisection
$k$-partitioned fuzzy graph
Partitioning networks into clusters and residuals with average association
Scalable module detection for attributed networks with applications to breast cancer
A new lower bound on the size of the smallest vertex separator of a graph
Semidefinite programming and combinatorial optimization
Semidefinite approximations for quadratic programs over orthogonal matrices
Partitioning through projections: strong SDP bounds for large graph partition problems
Spectral clustering and the high-dimensional stochastic blockmodel
Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks
Greedy recursive spectral bisection for modularity-bound hierarchical divisive community detection
Metric uniformization and spectral bounds for graphs
The MIN-cut and vertex separator problem
Multi-objective k-way parallel hypergraph partitioning with proximal gradient algorithm
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
Scalable Clustering: Large Scale Unsupervised Learning of Gaussian Mixture Models with Outliers
Cuts, cats, and complete graphs
Clustering with minimum spanning trees: how good can it be?
Enhancing Markowitz's portfolio selection paradigm with machine learning
On $r$-to-$p$ norms of random matrices with nonnegative entries: asymptotic normality and $\ell_{\infty}$-bounds for the maximizer
Spectral methods for graph clustering - a survey
Evaluating performance of image segmentation criteria and techniques
Detection of structurally homogeneous subsets in graphs
$\lambda_ 1$, isoperimetric inequalities for graphs, and superconcentrators
Spectral partitioning works: planar graphs and finite element meshes
New bounds for the -k-cut and chromatic number of a graph
Multiway spectral clustering: a margin-based perspective

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)