Skip to main navigation
Skip to search
Skip to main content
Experts@Minnesota Home
Home
Profiles
Research units
University Assets
Projects and Grants
Research output
Press/Media
Datasets
Activities
Fellowships, Honors, and Prizes
Search by expertise, name or affiliation
A fast and high quality multilevel scheme for partitioning irregular graphs
George Karypis
,
Vipin Kumar
Computer Science and Engineering
Research output
:
Contribution to journal
›
Article
›
peer-review
3881
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A fast and high quality multilevel scheme for partitioning irregular graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Partitioning
100%
Irregular
96%
Partition
74%
Graph in graph theory
46%
Graph Partitioning
39%
Coarsening
37%
Refinement
25%
Heuristics
24%
Parallel Processing
19%
Scientific Computing
19%
Collapsing
18%
Sparse matrix
16%
Minimum Degree
14%
Linear programming
13%
Finite Element Method
11%
Experiment
10%
Spectrality
10%
Range of data
8%
Class
4%
Engineering & Materials Science
Coarsening
81%
Natural sciences computing
43%
Graph algorithms
42%
Refining
32%
Linear programming
31%
Finite element method
20%
Experiments
11%