1951 search results - page 16 / 391 » An algorithm for improving graph partitions |
107
click to vote
ASPDAC
2000
ACM
15 years 4 months ago
2000
ACM
Multilevel Fiduccia-Mattheyses MLFM hypergraph partitioning 3, 22, 24 is a fundamental optimization in VLSI CAD physical design. The leading implementation, hMetis 23 , has sinc...
101
click to vote
JGAA
2000
14 years 11 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
APN
2005
Springer
15 years 5 months ago
2005
Springer
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondet...
WAW
2009
Springer
15 years 6 months ago
2009
Springer
STOC
1991
ACM
15 years 3 months ago
1991
ACM