ACM Home Page
Please provide us with feedback. Feedback
Multilevel k-way hypergraph partitioning
Full text PdfPdf (122 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 36th annual ACM/IEEE Design Automation Conference table of contents
New Orleans, Louisiana, United States
Pages: 343 - 348  
Year of Publication: 1999
ISBN:1-58133-109-7
Authors
George Karypis  Department of Computer Science & Engineering, University of Minnesota, Minneapolis, MN
Vipin Kumar  Department of Computer Science & Engineering, University of Minnesota, Minneapolis, MN
Sponsors
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 65,   Citation Count: 52
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/309847.309954
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
B. W. Kemighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291-307, 1970.
 
2
 
3
4
5
 
6
 
7
Horst D. Simon and Shang-Hua Teng. How good is recursive bisection? Technical Report RNR-93-012, NAS Systems Division, NASA, Moffet Field, CA, 1993.
8
 
9
 
10
 
11
J. Cong, W. Labio, and N. Shivakumar. Multi-way VLSI circuit partitioning based on dual net representation. IEEE Trans. on Computer-Aided Design of Integrated Cilvuits and Systems, pages 396-409, 1996.
 
12
B. Mobasher, N. Jain, E.H. Han, and J. Srivastava. Web mining: Pattern discovery from world wide web transactions. Technical Report TR-96-050, Department of Computer Science, University of Minnesota, Minneapolis, 1996.
 
13
14
 
15
George Karypis and Vipin Kumar. A coarse-grain parallel multilevel k-way partitioning algorithm. In P1vceedings of the eighth SlAM conference on Parallel P1vcessing for Scientific Computing, 1997.
16
17
 
18
G. Karypis and V. Kumar. hME-gS 1.5: A hypergraph partitioning package. Technical report, Department of Computer Science, University of Minnesota, 1998. Available on the WWW at URL http://www.cs.umn.edu/'metis.
 
19
 
20
G. Karypis and V. Kumar. Multilevel k-way hypergraph partitioning. Technical Report TR 98-036, Department of Computer Science, University of Minnesota, 1998.
21
 
22
 
23
 
24

CITED BY  52

Collaborative Colleagues:
George Karypis: colleagues
Vipin Kumar: colleagues