Upper bounds on the bisection width of 3- and 4-regular graphs.
Burkhard MonienRobert PreisPublished in: J. Discrete Algorithms (2006)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- lower and upper bounds
- tight bounds
- graph matching
- graph theoretic
- worst case
- branch and bound
- branch and bound algorithm
- graph theory
- graph structure
- graph databases
- vertex set
- multi class
- optimal solution
- graph mining
- efficiently computable
- error probability
- neural network
- graph partitioning
- spanning tree
- generalization error
- weighted graph
- bipartite graph
- linear programming
- active learning
- learning algorithm