• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

A fast and high quality multilevel scheme for partitioning irregular graphs (1998)

Cached

  • Download as a PDF

Download Links

  • [glaros.dtc.umn.edu]
  • [cacs.usc.edu]
  • [www-users.itlabs.umn.edu]
  • [ftp.cs.umn.edu]
  • [www.cs.umn.edu]
  • [www.stanford.edu]
  • [glaros.dtc.umn.edu]
  • [socialtag.googlecode.com]
  • [www.masters.donntu.edu.ua]
  • [masters.donntu.edu.ua]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by George Karypis , Vipin Kumar
Venue:SIAM JOURNAL ON SCIENTIFIC COMPUTING
Citations:1189 - 15 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Karypis98afast,
    author = {George Karypis and Vipin Kumar},
    title = {A fast and high quality multilevel scheme for partitioning irregular graphs},
    journal = {SIAM JOURNAL ON SCIENTIFIC COMPUTING},
    year = {1998},
    volume = {20},
    number = {1},
    pages = {359--392}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

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, Proc.

Keyphrases

irregular graph    high quality    original graph bui   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University