Minimum Bisection Problems in Graphs

We investigate under which conditions optimal bisections of graphs have to be very large. This has important applications for the design of divide-and-conquer algorithms in planar graphs.

Publikationen

• C.G.Fernandes, T.J.Schmidt, A. Taraz: On the structure of graphs with large minimum bisection Graph Theory and Applications(16): S. 291-296, 2013.
• C.G.Fernandes, T.J.Schmidt, A. Taraz: Structural Results and Algorithms for Planar Graphs with Large Minimum Bisection Width. Manuscript in preparation, [].