Bisection: A type of graph partitioning that splits the vertex set into two parts of nearly equal size, typically with the aim of minimising inter-part edge crossings.

COMP_ENG 357: Introduction to VLSI CAD VIEW ALL COURSE TIMES AND SESSIONS Prerequisites COMP_SCI 214 Description. CATALOG DESCRIPTION : Basic concepts in VLSI CAD with emphasis on physical design, ...

George Karypis, Vipin Kumar, Parallel Multilevel k-Way Partitioning Scheme for Irregular Graphs, SIAM Review, Vol. 41, No. 2 (Jun., 1999), pp. 278-300. ... the time taken by our parallel graph ...