![]() In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. Räcke, H.: Optimal hierarchical decompositions for congestion minimization in networks. Papadimitriou, C.H., Sideri, M.: The bisection width of grid graphs. PhD thesis, University of California, Berkeley (1978) MacGregor, R.: On partitioning a graph: A theoretical and empirical study. Kratochvíl, J.: Intersection graphs of noncrossing arc-connected sets in the plane. Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Karpinski, M.: Approximability of the minimum bisection problem: An algorithmic challenge. PhD thesis, Texas A
0 Comments
Leave a Reply. |