Lower Bounds for the Partitioning of Graphs

Cited in

(87)

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

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)