Results 11  20
of
970
Multilevel Circuit Partitioning
 IN PROC. OF THE 34TH ACM/IEEE DESIGN AUTOMATION CONFERENCE
, 1998
"... Many previous works in partitioning have used some underlying clustering algorithm to improve performance. As problem sizes reach new levels of complexity, a single application of a clustering algorithm is insufficient to produce excellent solutions. Recent work has illustrated the promise of multi ..."
Abstract

Cited by 89 (8 self)
 Add to MetaCart
ranging from 6.9 to 27.9 % for 100 runs and 3.0 to 20.6 % for just ten runs (while also using less CPU time). Further, our algorithm generates solutions better than the best known mincut bipartitionings for seven of the ACM/SIGDA benchmark circuits, including golem3 (which has over 100 000 cells). We also
Global Mincuts in RNC, and Other Ramifications of a Simple MinCut Algorithm
, 1992
"... This paper presents a new algorithm for nding global mincuts in weighted, undirected graphs. One of the strengths of the algorithm is its extreme simplicity. This randomized algorithm can be implemented as a strongly polynomial sequential algorithm with running time ~ O(mn 2), even if space is res ..."
Abstract

Cited by 70 (4 self)
 Add to MetaCart
is restricted to O(n), or can be parallelized as an RN C algorithm which runs in time O(log 2 n) on a CRCW PRAM with mn 2 log n processors. In addition to yielding the best known processor bounds on unweighted graphs, this algorithm provides the first proof that the mincut problem for weighted undirected
MinCut Partitioning with Functional Replication for Technology Mapped Circuits Using Minimum Area Overhead
, 2001
"... Logic replication is known to be an effective technique to reduce the number of cut nets in partitioned circuits. A new replication model called functional replication is particularly useful for partitioning technology mapped circuits [7]. Functional replication differs from traditional replication ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
partitioning problem with functional replication. We present a novel twophase algorithm to compute a mincut bipartition of a technology mapped circuit with functional replication using minimum amount of area overhead. And we show that our algorithm can be applied to improve the solution produced byany area
Modifying MinCut for Hardware and Software Functional Partitioning
 In International Workshop on HardwareSoftware Codesign
, 1997
"... The Kernighan/Lin heuristic, also known as mincut, has been extended very successfully for circuit partitioning over several decades. Those extensions customized the heuristic and its associated data structure to rapidly compute the minimumcut metric required during circuit partitioning; thus, tho ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
The Kernighan/Lin heuristic, also known as mincut, has been extended very successfully for circuit partitioning over several decades. Those extensions customized the heuristic and its associated data structure to rapidly compute the minimumcut metric required during circuit partitioning; thus
Efficient Network Flow Based MinCut Balanced Partitioning
, 1996
"... We consider the problem of bipartitioning a circuit into two balanced components that minimizes the number of crossing nets. Previously, Kernighan and Lin type (K&L) heuristics, simulated annealing approach, and analytical methods were given to solve the problem. However, network flow (maxflow ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
mincut) techniques were overlooked as viable heuristics to mincut balanced bipartition due to their high complexity. In this paper we propose a balanced bipartition heuristic based on repeated maxflow mincut techniques, and give an efficient implementation that has the same asymptotic time
A SIMPLE AND FAST MINCUT ALGORITHM
"... We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O ( ` max (log n, min (m/n, δG/ε)) n 2 ´ , where ε is the minimal edge weight, and δG the minimal weighted degree. For integer edge weig ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
weights this time is further improved to O(δGn 2) and O(λGn 2). In both cases these bounds are improvements of the previously known best bounds of deterministic algorithms. These were O(nm + log nn 2) for real edge weights and O(nM + n 2) and O(M + λGn 2) for integer weights, where M is the sum of all
Faster scaling algorithms for network problems
 SIAM J. COMPUT
, 1989
"... This paper presents algorithms for the assignment problem, the transportation problem, and the minimumcost flow problem of operations research. The algorithms find a minimumcost solution, yet run in time close to the bestknown bounds for the corresponding problems without costs. For example, the ..."
Abstract

Cited by 163 (5 self)
 Add to MetaCart
This paper presents algorithms for the assignment problem, the transportation problem, and the minimumcost flow problem of operations research. The algorithms find a minimumcost solution, yet run in time close to the bestknown bounds for the corresponding problems without costs. For example
Towards Optimizing Global MinCut Partitioning
 In Proceedings of the 2 nd European Design Automation Conference
, 1991
"... MinCut algorithms have received much attention in the past for treating the placement problem in layout synthesis. The paper introduces a new class of MinCut partitioning algorithms (SQP) meeting global minimization requirements. The new class of algorithms in its different variations is empirically ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
is empirically compared with the classical MinCut procedures as well as with recent extensions. The new algorithms have shown a significant (10 to 40%) improvement in the overall netlength compared with known algorithms. Moreover, the new class of algorithms is proved to have a linear time complexity. 1
Analysis and Optimization of Max Flow Mincut
"... Today we are working with the networks all around and that’s why it becomes very important to find the effective flow of the commodity within that network. This paper aims to provide an analysis of the best known algorithm for calculating maximum flow of any network and to propose an approximate alg ..."
Abstract
 Add to MetaCart
Today we are working with the networks all around and that’s why it becomes very important to find the effective flow of the commodity within that network. This paper aims to provide an analysis of the best known algorithm for calculating maximum flow of any network and to propose an approximate
Some links between mincuts, optimal spanning forests and watersheds
, 2007
"... Keywords: Di erent optimal structures: minimum cuts, minimum spanning forests and shortestpath forests, have been used as the basis for powerful image segmentation procedures. The wellknown notion of watershed also falls into this category. In this paper, we present some new results about the link ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
Keywords: Di erent optimal structures: minimum cuts, minimum spanning forests and shortestpath forests, have been used as the basis for powerful image segmentation procedures. The wellknown notion of watershed also falls into this category. In this paper, we present some new results about
Results 11  20
of
970