Pages that link to "Item:Q5675744"
From MaRDI portal
The following pages link to Lower Bounds for the Partitioning of Graphs (Q5675744):
Displayed 33 items.
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs (Q686456) (← links)
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators (Q800384) (← links)
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← 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)
- 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)
- A survey of kernel and spectral methods for clustering (Q2384965) (← links)
- Consistency of spectral clustering (Q2426615) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Local and global approaches of affinity propagation clustering for large scale data (Q2519433) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- Spectral clustering based on matrix perturbation theory (Q2644417) (← links)
- The optimal partitioning of networks (Q3993635) (← links)
- Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée (Q4546064) (← links)
- An Algorithm for Partitioning the Nodes of a Graph (Q4740598) (← links)
- A survey of graph laplacians (Q4853923) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)