Download:
|
by Y. Saab, V. Rao, Fast Ieee, Trans Computeraided
http://nexus6.cs.ucla.edu/~cheese/Survey/part7.ps
Add To MetaCart
Abstract:
[190] H. Yang and D. F. Wong. Efficient network flow based min-cut balanced partitioning. In Proc. IEEE
Citations
|
253
|
A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
– Barnard, Simon
- 1993
|
|
200
|
A Connectionist Machine for Genetic Hillclimbing
– Ackley
- 1987
|
|
50
|
Spectral partitioning: The more eigenvectors, the better
– Alpert, Yao
- 1995
|
|
33
|
A general framework for vertex orderings, with applications to netlist clustering
– Hagen, Kahng
- 1996
|
|
11
|
Advanced Search Techniques for Circuit Partitioning
– Areibi, Vannelli
- 1994
|
|
7
|
A Graph Partitioning Heuristic for the Parallel Pseudo-Exhaustive Logical Test of VLSI Combinational Circuits
– Andreatta, Ribeiro
- 1994
|
|
5
|
A combined eigenvector tabu search approach for circuit partitioning
– Areibi, Vannelli
- 1993
|
|
3
|
Packaging for VLSI, Addison-Wesley Pub
– Bakoglu, Circuits
- 1990
|
|
2
|
An efficient solution to circuit partitioning using tabu search and genetic algorithms
– Areibi, Vannelli
- 1994
|
|
1
|
Geometric embeddings for faster and better multi-way netlist partitioning
– Hall
- 1993
|
|
1
|
New heuristics and lower bounds for graph partitioning
– Circuits, Systems
- 1990
|
|
1
|
Multicommodity flows: A survey of recent research
– Circuits, Systems
- 1991
|
