Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- articleDecember 2011
Mincuts in generalized Fibonacci graphs of degree 3
Journal of Computational Methods in Sciences and Engineering (JOCMSE), Volume 11, Issue 5-6Pages 271–280We investigate the structure of mincuts in an n-vertex generalized Fibonacci graph of degree 3 and show that the number |CF3(n)| of mincuts in this graph is equal to |CF3 (n - 1)| + |CF3(n - 2)| + |CF3(n - 3)|-|CF3(n -4)|-|CF3 (n -5)| +1.
- ArticleJuly 2011
A distributed mincut/maxflow algorithm combining path augmentation and push-relabel
We present a novel distributed algorithm for the minimum s-t cut problem, suitable for solving large sparse instances. Assuming vertices of the graph are partitioned into several regions, the algorithm performs path augmentations inside the regions and ...
- ArticleApril 2005
NTUplace: a ratio partitioning based placement algorithm for large-scale mixed-size designs
ISPD '05: Proceedings of the 2005 international symposium on Physical designPages 236–238https://doi.org/10.1145/1055137.1055188In this paper, we present a hierarchical ratio partitioning based placement algorithm for large-scale mixed-size designs. The placement algorithm consists of three steps: global placement, legalization,and detailed placement; it works in a hierarchical ...
- articleJanuary 2002
Cluster-aware iterative improvement techniques for partitioning large VLSI circuits
ACM Transactions on Design Automation of Electronic Systems (TODAES), Volume 7, Issue 1Pages 91–121https://doi.org/10.1145/504914.504918Move-based iterative improvement partitioning (IIP) methods, such as the Fiduccia-Mattheyses (FM) algorithm [Fidducia and Mattheyses 1982] and Krishnamurthy's Look-Ahead (LA) algorithm [Krishnamurthy 1984], are widely used in VLSI CAD applications, ...