Table of Contents
VLSI Design
Volume 11, Issue 3, Pages 301-310

A New 2-way Multi-level Partitioning Algorithm

Computer Engineering and Computer Science Department, University of Missouri-Columbia, Engineering Building West, Columbia 65211, MO, USA

Received 1 March 1999; Accepted 10 February 2000

Copyright © 2000 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Citations to this Article [4 citations]

The following is the list of published articles that have cited the current article.

  • Mitali Sinha, Rakesh Mohanty, Prachi Tripathy, and Suchismita Pattanaik, “Experimental study of a novel variant of Fiduccia Mattheyses(FM) partitioning algorithm,” 2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI), pp. 1820–1825, . View at Publisher · View at Google Scholar
  • Y.G. Saab, “An effective multilevel algorithm for bisecting graphs and hypergraphs,” IEEE Transactions on Computers, vol. 53, no. 6, pp. 641–652, 2004. View at Publisher · View at Google Scholar
  • Pierre Chardaire, Musbah Barake, and Geoff P. McKeown, “A PROBE-Based Heuristic for Graph Partitioning,” IEEE Transactions on Computers, vol. 56, no. 12, pp. 1707–1720, 2007. View at Publisher · View at Google Scholar
  • Roman Bazylevych, Ihor Podolskyy, and Lubov Bazylevych, “Partitioning optimization by recursive moves of hierarchically built clusters,” Proceedings of the 2007 IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems, DDECS, pp. 235–238, 2007. View at Publisher · View at Google Scholar