Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.
Burkhard MonienRobert PreisPublished in: MFCS (2001)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- worst case
- tight bounds
- branch and bound
- branch and bound algorithm
- lower and upper bounds
- graph theory
- graph theoretic
- tight upper and lower bounds
- efficiently computable
- permutation flowshop
- generalization error
- graph matching
- concept classes
- graph clustering
- graph construction
- error probability
- semi supervised
- upper bounding
- np hard