| Alternate document: Details A Fast and High Quality Multilevel Scheme for (98) George Karypis, Vipin Kumar |
George Karypis, Vipin Kumar  Home/Search
Context Related
| siam.org/sambin/getfile/S...28799.ps.Z From: siam.org/sambin/dbq/arti...28799 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: .<F3.819e+05> Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones,<F3.543e+05> Proc. of the<F3.819e+05><F3.543e+05> 6th SIAM Conference on Parallel Processing for Scientific<F3.819e+05> Computing, 1993, 445--452; Hendrickson and Leland,<F3.543e+05> A Multilevel Algorithm for... (Update)
Cited by: More
SURF 2005; final report - Load Balancing Strategies (Correct)
Unknown - (Correct)
Transport in Dynamical Astronomy and Multibody Problems - Dellnitz, Junge, Koon.. (2005) (Correct)
Similar documents (at the sentence level):
56.1%: A Fast and High Quality Multilevel Scheme for. . . - Karypis, Kumar (1998) (Correct)
Active bibliography (related documents): More All
3.5: Improving The Run Time And Quality Of Nested Dissection.. - Hendrickson, Rothberg (1998) (Correct)
0.5: On The Quality Of Spectral Separators - Guattery, Miller (1998) (Correct)
0.5: Computing Matrix Eigenvalues And Polynomial Zeros Where The.. - Bini, Pan (1998) (Correct)
Similar documents based on text: More All
0.8: Parallel Multilevel k-way Partitioning Scheme for Irregular.. - Karypis, Kumar (1996) (Correct)
0.5: Multilevel k-way Partitioning Scheme for Irregular Graphs - Karypis, Kumar (Correct)
0.3: A Parallel Formulation of Interior Point - Algorithms George Karypis (Correct)
Related documents from co-citation: More All
47: A Multilevel Algorithm for Partitioning Graphs - Hendrickson, Leland
36: An Efficient Heuristic Procedure for Partitioning Graphs (context) - Kernighan, Lin - 1970
34: A linear time heuristic for improving network partitions (context) - Fiduccia, Mattheyses - 1982
BibTeX entry: (Update)
@techreport{ karypis95fast,
author = "George Karypis and Vipin Kumar",
title = "A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs",
number = "TR 95-035",
year = "1995",
url = "citeseer.ist.psu.edu/karypis98fast.html" }
Citations (may not include all citations):421 A linear time heuristic for improving network partitions (context) - Fiduccia, Mattheyses - 1982
346 Computer Solution of Large Sparse Positive Definite<F (context) - George, Liu - 1981
309 Partitioning sparse matrices with eigenvectors of (context) - Pothen, Simon et al. - 1990
288 Introduction to Parallel Computing: Design and Analysis of (context) - Kumar, Grama et al. - 1994
222 A fast multilevel implementation of recursive spectral bisec.. - Barnard, Simon - 1993
168 An approximate max-flow min-cut theorem for uniform multicom.. (context) - Leighton, Rao - 1988
165 Sandia National Laboratories (context) - Hendrickson, Leland et al. - 1993
115 An Improved Spectral Graph Partitioning Algorithm for Mappin.. - Hendrickson, Leland - 1992
74 Modification of the minimum degree algorithm by multiple<F (context) - Liu - 1985
72 Graph bisection algorithms with good average case<F (context) - Bui, Chaudhuri et al. - 1987
67 A unified geometric approach to graph separators (context) - Miller, Teng et al. - 1991
64 Geometric mesh partitioning: Implementation and<F - Gilbert, Miller et al. - 1995
57 Highly scalable parallel algorithms for sparse matrix <F - Gupta, Karypis et al. - 1997
44 Parallel algorithms for dynamically partitioning unstructure.. - Diniz, Plimpton et al. - 1995
41 Fast spectral methods for ratio cut partitioning and<F (context) - Hagen, Kahng - 1991
36 An improved two-way partitioning algorithm with stable<F (context) - Cheng, Wei - 1991
33 A parallel graph partitioning algorithm for a message-passin.. (context) - Gilbert, Zmijewski - 1987
14 A parallel implementation of multilevel recursive spectral b.. (context) - Barnard, Simon - 1995
11 Graph contraction and physical optimization methods: A quali.. (context) - Ponnusamy, Mansour et al. - 1993
10 Department of Computer Science (context) - Raghavan, Line et al. - 1993
9 Computer Science Department (context) - Pothen, Simon et al. - 1992
5 the Validity of a Front-Oriented Approach to Partitioning La.. - Ciarlet, Lamour et al. - 1994
3 Mapping Unstructured Grid Problems to Massively Parallel<F (context) - Hammond - 1992
3 A Parallel Implementation of the Multiple Minimum Degree Ord.. (context) - Ghose, Rothberg - 1994
2 The evolution of the minimum degree ordering<F (context) - George, Liu - 1989
2 The Symmetric Eigenvalue<F (context) - Parlett - 1980
2 A Multilevel Algorithm for Partitioning<F (context) - Hendrickson, Leland - 1993
2 Computing the block triangular form of a sparse<F (context) - Pothen, Fan - 1990
2 Towards a fast implementation of spectral nested<F (context) - Pothen, Simon et al. - 1992
2 cient heuristic procedure for partitioning<F (context) - Kernighan, Lin et al. - 1970
2 An algorithm for partitioning the nodes of (context) - Barnes - 1984
2 Nested dissection of a regular finite-element<F (context) - George - 1973
2 A heuristic for reducing fill in sparse matrix<F (context) - Bui, Jones - 1993
1 also available online from http://www (context) - Karypis, Kumar et al. - 1995
1 Finding clusters in VLSI<F (context) - Garbers, Promel et al. - 1990
1 A separator theorem for planar<F (context) - Lipton, Tarjan - 1979
1 Heuristic Algorithms for Automatic Graph<F (context) - Goehring, Saad - 1994
1 A parallel formulation of interior point<F (context) - Karypis, Gupta et al. - 1994
1 A Cartesian parallel nested dissection<F (context) - Heath, Raghavan - 1995
1 Automatic mesh<F (context) - Miller, Teng et al. - 1993
1 Solution to sparse indefinite systems of linear<F (context) - Paige, Saunders - 1974
1 Xerox PARC Tech (context) - Chan, Gilbert et al. - 1994
1 A new approach to e#ective circuit<F (context) - Hagen, Kahng - 1992
1 Solving finite element equations on concurrent<F (context) - Nour-Omid, Raefsky et al. - 1986
1 Multilevel graph partition and sparse matrix<F (context) - Karypis, Kumar - 1995
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC