Results 1  10
of
7,790
Multilevel hypergraph partitioning
 Applications in VLSI design, ACM/IEEE Design Automation Conference
, 1997
"... Traditional hypergraph partitioning algorithms compute a bisection a graph such that the number of hyperedges that are cut by the partitioning is minimized and each partition has an equal number of vertices. The task of minimizing the cut can be considered as the objective and the requirement that t ..."
Abstract

Cited by 73 (3 self)
 Add to MetaCart
Traditional hypergraph partitioning algorithms compute a bisection a graph such that the number of hyperedges that are cut by the partitioning is minimized and each partition has an equal number of vertices. The task of minimizing the cut can be considered as the objective and the requirement
Multilevel kway Hypergraph Partitioning
, 1999
"... In this paper, we present a new multilevel kway hypergraph partitioning algorithm that substantially outperforms the existing stateoftheart KPM/LR algorithm for multiway partitioning, both for optimizing local as well as global objectives. Experiments on ..."
Abstract

Cited by 170 (11 self)
 Add to MetaCart
In this paper, we present a new multilevel kway hypergraph partitioning algorithm that substantially outperforms the existing stateoftheart KPM/LR algorithm for multiway partitioning, both for optimizing local as well as global objectives. Experiments on
Multilevel hypergraph partitioning: Application in VLSI domain
 IEEE TRANS. VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS
, 1999
"... In this paper, we present a new hypergraphpartitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergraphs is constructed. A bisection of the smallest hypergraph is computed and it is used to obtain a bisection of the origina ..."
Abstract

Cited by 315 (22 self)
 Add to MetaCart
as on the run time for a number of very large scale integration circuits. Our experiments show that our multilevel hypergraphpartitioning algorithm produces highquality partitioning in a relatively small amount of time. The quality of the partitionings produced by our scheme are on the average 6%–23 % better
Parallel Algorithms for Hypergraph Partitioning
, 2006
"... Nearoptimal decomposition is central to the efficient solution of numerous problems in scientific computing and computeraided design. In particular, intelligent a priori partitioning of input data can greatly improve the runtime and scalability of largescale parallel computations. Discrete data ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
data structures such as graphs and hypergraphs are used to formalise such partitioning problems, with hypergraphs typically preferred for their greater expressiveness. Optimal graph and hypergraph partitioning are NPcomplete problems; however, serial heuristic algorithms that run in low
Multilevel algorithms for . . . hypergraph partitioning
, 1999
"... Traditional hypergraph partitioning algorithms compute a bisection a graph such that the number of hyperedges that are cut by the partitioning is minimized and each partition has an equal number of vertices. The task of minimizing the cut can be considered as the objective and the requirement that t ..."
Abstract
 Add to MetaCart
Traditional hypergraph partitioning algorithms compute a bisection a graph such that the number of hyperedges that are cut by the partitioning is minimized and each partition has an equal number of vertices. The task of minimizing the cut can be considered as the objective and the requirement
Hypergraph Partitioning With Fixed Vertices
 DAC'99
, 1999
"... We empirically assess the implications of fixed terminals for hypergraph partitioning heuristics. Our experimental testbed incorporates a leadingedge multilevel hypergraph partitioner [14] [3] and IBMinternal circuits that have recently been released as part of the ISPD98 Benchmark Suite [2, 1]. ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We empirically assess the implications of fixed terminals for hypergraph partitioning heuristics. Our experimental testbed incorporates a leadingedge multilevel hypergraph partitioner [14] [3] and IBMinternal circuits that have recently been released as part of the ISPD98 Benchmark Suite [2, 1
Hypergraph Partitioning With Fixed Vertices
 IEEE TRANS. ON CAD
, 2000
"... We empirically assess the implications of fixed terminals for hypergraph partitioning heuristics. Our experimental testbed incorporates a leadingedge multilevel hypergraph partitioner [12] [3] and IBMinternal circuits that have recently been released as part of the ISPD98 Benchmark Suite [2, 1]. ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We empirically assess the implications of fixed terminals for hypergraph partitioning heuristics. Our experimental testbed incorporates a leadingedge multilevel hypergraph partitioner [12] [3] and IBMinternal circuits that have recently been released as part of the ISPD98 Benchmark Suite [2, 1
Parallel hypergraph partitioning for scientific computing
 In Proc. IPDPS’06. IEEE
, 2006
"... Graph partitioning is often used for load balancing in parallel computing, but it is known that hypergraph partitioning has several advantages. First, hypergraphs more accurately model communication volume, and second, they are more expressive and can better represent nonsymmetric problems. Hypergra ..."
Abstract

Cited by 56 (18 self)
 Add to MetaCart
Graph partitioning is often used for load balancing in parallel computing, but it is known that hypergraph partitioning has several advantages. First, hypergraphs more accurately model communication volume, and second, they are more expressive and can better represent nonsymmetric problems
Hypergraph Partitioning and Clustering
 In Approximation Algorithms and Metaheuristics
, 2007
"... A hypergraph is a generalization of a graph wherein edges can connect more than two vertices and are called hyperedges. Just as graphs naturally represent many kinds of information in mathematical and computer science problems, hypergraphs also arise naturally in important practical problems, incl ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
A hypergraph is a generalization of a graph wherein edges can connect more than two vertices and are called hyperedges. Just as graphs naturally represent many kinds of information in mathematical and computer science problems, hypergraphs also arise naturally in important practical problems
Fast hypergraph partition
 in Proceedings of the 26th ACM/IEEE Design Automation Conference
, 1989
"... We present a new 0 (n2) heuristic for hypergraph mincut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our approach is based on the intersection gruph G dual to the input hypergraph. Paths in G are used to construct purtiul bipa ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We present a new 0 (n2) heuristic for hypergraph mincut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our approach is based on the intersection gruph G dual to the input hypergraph. Paths in G are used to construct purtiul
Results 1  10
of
7,790