Random walks for circuit clustering
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Fast spectral methods for ratio cut partitioning and clusteringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Finding clusters in VLSI circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Combinatorial Algorithms for Integrated Circuit LayoutPublished by Springer Nature ,1990
- The electrical resistance of a graph captures its commute and cover timesPublished by Association for Computing Machinery (ACM) ,1989
- On the cover time of random walks on graphsJournal of Theoretical Probability, 1989
- Graph bisection algorithms with good average case behaviorCombinatorica, 1987