SIGN IN
SIGN UP
Multi-level spectral hypergraph partitioning with arbitrary vertex sizes
Full Text:
Pdf
Buy this Article
Authors:
Jason Y. Zien
Computer Engineering, University of California at Santa Cruz, Santa Cruz, CA
Martine D. F. Schlag
Computer Engineering, University of California at Santa Cruz, Santa Cruz, CA
Pak K. Chan
Computer Engineering, University of California at Santa Cruz, Santa Cruz, CA
Published in:
· Proceeding
ICCAD '96
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
IEEE Computer Society
Washington, DC
, USA
©1996
table of contents
ISBN:0-8186-7597-7
1997 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 7
· Citation Count: 4
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
ICCAD '12
Publisher Site
Share:
|
Tags:
design
eigenvalues and eigenvectors
general
graph algorithms
partitioning, spectral, multi-level, arbitrary vertex size, contraction, generalized eigenvalue problem, clustering
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder