Searching for "On max cut in cubic graphs." – sorted by Relevance.
-
MAX CUT in cubic graphs
- Abstract MAX CUT in cubic graphs Eran Halperin ∗ Dror Livnat ∗ Uri Zwick ∗ We present an improved
- Cited by 4 (0 self) – Add To MetaCart
-
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs
- A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs T. Calamoneri 1⋆ ,I
- Cited by 1 (0 self) – Add To MetaCart
-
Hardness of Approximating Problems on Cubic Graphs
- of our results, but for showing the APX-completeness of MAX CUT on cubic graphs we need a quite
- Cited by 32 (0 self) – Add To MetaCart
-
Int. J. of Computational Science and Engineering, Vol. 1, No. 1, xxxx 1 On Greedy Construction Heuristics for the
- ,elif,butenko,ivhicks}@(email omitted); Abstract: Given a graph with non-negative edge weights, the MAX- CUT problem is to partition the set
- Add To MetaCart

