Name
Title | ||
|---|---|---|
An efficient K-way graph partitioning algorithm for task allocation in parallel computing systems |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1109/ICSI.1990.138741 | ICSI |
Keywords | Field | DocType |
computational complexity,graph theory,parallel algorithms,resource allocation,Kernighan-Lin algorithm,cost function,edge weight,graph modification,k-way graph partitioning algorithm,maximum k-cut problem,node size,parallel computing systems,performance,task allocation | Strength of a graph,Computer science,Johnson's algorithm,Parallel computing,Algorithm,Matching (graph theory),Suurballe's algorithm,Graph bandwidth,Graph partition,Kruskal's algorithm,Reverse-delete algorithm | Conference |
ISBN | Citations | PageRank |
0-8186-9027-5 | 13 | 0.91 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cheol H. Lee | 1 | 13 | 0.91 |
| M. Kim | 2 | 15 | 1.98 |
| Chan I. Park | 3 | 13 | 0.91 |