Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs.
Brett KolesnikNick WormaldPublished in: SIAM J. Discret. Math. (2014)
Keyphrases
- lower bound
- graph partitioning
- upper bound
- objective function
- branch and bound algorithm
- branch and bound
- random instances
- graph representation
- image segmentation
- optimal cost
- planar curves
- np hard
- optimal solution
- weighted graph
- graph mining
- graph structure
- graph theory
- vc dimension
- graph theoretic
- graph databases
- sample complexity
- lower and upper bounds
- quadratic assignment problem
- clustering algorithm