Keyphrases
Graph Partitioning
100%
Large Graphs
100%
Doubly Nonnegative Relaxation
75%
Cutting Planes
50%
Polyhedral
25%
Benchmark Instances
25%
Matrix Variable
25%
Positive Semidefinite
25%
Computational Results
25%
Cutting Plane Algorithm
25%
Equipartition
25%
Vertex Set
25%
Facial Reduction
25%
Augmented Lagrangian Method
25%
Dykstra's Algorithm
25%
Doubly Nonnegative
25%
Graph Bisection Problems
25%
Disjoint Subset
25%
Mathematics
Graph Partition
100%
Matrix (Mathematics)
25%
Positive Semidefinite
25%
Edge
25%
Lagrangian
25%
Fixed Number
25%
Disjoint Subset
25%
Computer Science
Graph Partition Problem
100%
Cutting Plane Algorithm
25%
Benchmark Instance
25%
Disjoint Subset
25%
Engineering
Cutting Plane
100%
Lagrangian Method
33%