Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/1982
Full metadata record
DC FieldValueLanguage
dc.contributor.authorErciyeş, Kayhan-
dc.contributor.authorAlp, Ali-
dc.contributor.authorMarshall, Geoffrey-
dc.date.accessioned2016-07-27T06:59:18Z
dc.date.available2016-07-27T06:59:18Z
dc.date.issued2005
dc.identifier.citationErciyeş, K., Alp, A., and Marshall, G. (2005). Serial and parallel multilevel graph partitioning using fixed centers. Lecture Notes in Computer Science, 3381, 127-136. doi:10.1007/978-3-540-30577-4_16en_US
dc.identifier.issn0302-9743
dc.identifier.issn0302-9743-
dc.identifier.issn1611-3349-
dc.identifier.urihttp://doi.org/10.1007/978-3-540-30577-4_16
dc.identifier.urihttp://hdl.handle.net/11147/1982
dc.description31st Conference on Current Trends in Theory and Practice of Computer Science; Liptovsky Jan; Slovakia; 22 January 2005 through 28 January 2005en_US
dc.description.abstractWe present new serial and parallel algorithms for multilevel graph partitioning. Our algorithm has coarsening, partitioning and uncoarsening phases like other multilevel partitioning methods. However, we choose fixed nodes which are at least a specified distance away from each other and coarsen them with their neighbor nodes in the coarsening phase using various heuristics. Using this algorithm, it is possible to obtain theoretically and experimentally much more balanced partitions with substantially decreased total edge costs between the partitions than other algorithms. We also developed a parallel method for the fixed centered partitioning algorithm. It is shown that parallel fixed centered partitioning obtains significant speedups compared to the serial case.en_US
dc.language.isoenen_US
dc.publisherSpringer Verlagen_US
dc.relation.ispartofLecture Notes in Computer Scienceen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectAlgorithmsen_US
dc.subjectCostsen_US
dc.subjectGraph theoryen_US
dc.subjectPartitioningen_US
dc.subjectParallel algorithmen_US
dc.titleSerial and parallel multilevel graph partitioning using fixed centersen_US
dc.typeConference Objecten_US
dc.authoridTR125627en_US
dc.institutionauthorErciyeş, Kayhan-
dc.departmentIzmir Institute of Technology. Computer Engineeringen_US
dc.identifier.volume3381en_US
dc.identifier.startpage127en_US
dc.identifier.endpage136en_US
dc.identifier.wosWOS:000228554400016en_US
dc.identifier.scopus2-s2.0-24144466383en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.identifier.doi10.1007/978-3-540-30577-4_16-
dc.relation.doi10.1007/978-3-540-30577-4_16en_US
dc.coverage.doi10.1007/978-3-540-30577-4_16en_US
dc.identifier.scopusqualityQ2-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.fulltextWith Fulltext-
item.grantfulltextopen-
item.openairetypeConference Object-
item.languageiso639-1en-
crisitem.author.dept03.04. Department of Computer Engineering-
Appears in Collections:Computer Engineering / Bilgisayar Mühendisliği
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Files in This Item:
File Description SizeFormat 
1982.pdfConference Paper166.53 kBAdobe PDFThumbnail
View/Open
Show simple item record

CORE Recommender

SCOPUSTM   
Citations

4
checked on Aug 10, 2022

Page view(s)

74
checked on Aug 15, 2022

Download(s)

88
checked on Aug 15, 2022

Google ScholarTM

Check

Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.