The bisection width of grid graphs

Theory of Computing Systems

Volumn 29, Issue 2, 1996, Pages 97-110

  Papadimitriou, C H ^a   Sideri, M ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

BISECTION WIDTH; GRID GRAPHS; INDUCED SUBGRAPHS; POLYNOMIAL ALGORITHM;

DYNAMIC PROGRAMMING;

EID: 0344791799     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF01305310     Document Type: Article

References (8)

1. [GJ] M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
2. [GJS] M. R. Garey, D. S. Johnson, and L. J. Stockmeyer, Some simplified NP-complete problems, Theoret. Comput. Sci., 1 (1976), 237-267.
3. [IPS] A. Itai, C. Papadimitriou, and J. Swarcfiter, Hamilton paths in grid graphs, SIAM J. Comput., 10(4) (1981), 676-686.
4. [KPS] E. Koutsoupias, C. H. Papadimitriou, and M. Sideri, Optimum bisection of a polygon, Proc. 1990 Computational Geometry Conference. Also, J. Oper. Res. Comput. Sci., 4 (1994), 345-348.
5. [KPS] E. Koutsoupias, C. H. Papadimitriou, and M. Sideri, Optimum bisection of a polygon, Proc. 1990 Computational Geometry Conference. Also, J. Oper. Res. Comput. Sci., 4 (1994), 345-348.
6. [KPSS] B. Korte, H. J. Prömel, E. Schwietzke, and A. Steger, Partitioning and Placement in VLSI Layout, Report 88500-OR, Univ. of Bonn, 1988.
7. [R1] S. Rao, Finding near-optimal separators in planar graphs, Proc. 1987 FOCS, pp. 225-237.
8. [R2] S. Rao, Faster algorithms for finding small edge cuts in planar graphs, Proc. 1992 STOC, pp. 229-240.