<F3.746e+05> J. Garbers, H. J. Promel, and A.<F3.819e+05> Steger,<F3.543e+05> Finding clusters in VLSI<F3.819e+05> circuits, in Proc. of IEEE International Conference on Computer Aided Design, 1990, pp. 520--523.  Home/Search   Document Not in Database   Summary   Related Articles

....Another class of graph partitioning algorithms reduces the size of the graph (i.e. coarsen the graph) by collapsing vertices and edges, partitions the smaller graph, and then uncoarsens it to construct a partition for the original graph. These are called multilevel graph partitioning schemes [4, 7, 19, 20, 26, 10, 43]. Some researchers investigated multilevel schemes primarily to decrease the partitioning time, at the cost of somewhat worse partition quality [43] Recently, a number of multilevel algorithms have been proposed [4, 26, 7, 20, 10] that further refine the partition during the uncoarsening phase. ....

.... These are called multilevel graph partitioning schemes [4, 7, 19, 20, 26, 10, 43] Some researchers investigated multilevel schemes primarily to decrease the partitioning time, at the cost of somewhat worse partition quality [43] Recently, a number of multilevel algorithms have been proposed [4, 26, 7, 20, 10] that further refine the partition during the uncoarsening phase. These schemes tend to give good partitions at a reasonable cost. Bui and Jones [4] use random maximal matching to successively coarsen the graph down to a few hundred vertices; they partition the smallest graph and then uncoarsen ....

[Article contains additional citation context not shown here]

<F3.746e+05> J. Garbers, H. J. Promel, and A.<F3.819e+05> Steger,<F3.543e+05> Finding clusters in VLSI<F3.819e+05> circuits, in Proc. of IEEE International Conference on Computer Aided Design, 1990, pp. 520--523.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC