Article contents
Maximizing Several Cuts Simultaneously
Published online by Cambridge University Press: 01 March 2007
Abstract
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that, for both i = 1, 2, we have . This gives an approximate answer to a question of Bollobás and Scott. We also prove results about partitions into more than two vertex classes. Our proofs yield polynomial algorithms.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2006
References
- 7
- Cited by