Pages that link to "Item:Q5675744"
From MaRDI portal
The following pages link to Lower Bounds for the Partitioning of Graphs (Q5675744):
Displayed 50 items.
- Bayesian degree-corrected stochastic blockmodels for community detection (Q315413) (← links)
- General Cheeger inequalities for \(p\)-Laplacians on graphs (Q334094) (← links)
- Bound and exact methods for assessing link vulnerability in complex networks (Q405658) (← links)
- Fast density-weighted low-rank approximation spectral clustering (Q408661) (← links)
- Fast semi-supervised clustering with enhanced spectral embedding (Q454422) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- Spectral clustering and the high-dimensional stochastic blockmodel (Q651016) (← links)
- Metric uniformization and spectral bounds for graphs (Q659931) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs (Q686456) (← links)
- Spectral methods for graph clustering - a survey (Q713095) (← links)
- Evaluating performance of image segmentation criteria and techniques (Q743635) (← links)
- Detection of structurally homogeneous subsets in graphs (Q746312) (← links)
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators (Q800384) (← links)
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- Multiway spectral clustering: a margin-based perspective (Q908150) (← links)
- Grouping of parts and components in flexible manufacturing systems (Q1080770) (← links)
- Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality (Q1187508) (← links)
- Optimal partitions having disjoint convex and conic hulls (Q1190601) (← links)
- Spectral partitioning with multiple eigenvectors (Q1276952) (← links)
- Path optimization for graph partitioning problems (Q1276954) (← links)
- A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix (Q1312086) (← links)
- Laplacian eigenvalues and the maximum cut problem (Q1319025) (← links)
- A computational study of graph partitioning (Q1340061) (← links)
- On minimizing the largest eigenvalue of a symmetric matrix (Q1345514) (← links)
- Spectral methods for graph bisection problems. (Q1406654) (← links)
- Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) (← links)
- Laplacian eigenvalues and fixed size multisection (Q1422418) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Algorithms for graph partitioning problems by means of eigenspace relaxations (Q1577115) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- On the multiplicity of Laplacian eigenvalues and Fiedler partitions (Q1637997) (← links)
- Graph-based point drift: graph centrality on the registration of point-sets (Q1677064) (← links)
- Spectral bisection with two eigenvectors (Q1690049) (← links)
- Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer (Q1727851) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
- Lower bounds for the quadratic assignment problem via triangle decompositions (Q1914071) (← links)
- Semidefinite programming relaxations for the graph partitioning problem (Q1961466) (← links)
- QCC: a novel clustering algorithm based on quasi-cluster centers (Q2014571) (← links)
- Convex programming based spectral clustering (Q2051294) (← links)
- Spectral clustering revisited: information hidden in the Fiedler vector (Q2072633) (← links)
- Data clustering based on the modified relaxation Cheeger cut model (Q2115038) (← links)
- A review on spectral clustering and stochastic block models (Q2132025) (← links)
- Non-asymptotic properties of spectral decomposition of large Gram-type matrices and applications (Q2137016) (← links)
- Complex Hadamard diagonalisable graphs (Q2197273) (← links)
- Diffusion bank networks and capital flows (Q2230764) (← links)
- Topological graph clustering with thin position (Q2248883) (← links)
- Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs (Q2302231) (← links)