Please use this identifier to cite or link to this item:
https://hdl.handle.net/11147/1982
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Erciyeş, Kayhan | - |
dc.contributor.author | Alp, Ali | - |
dc.contributor.author | Marshall, Geoffrey | - |
dc.date.accessioned | 2016-07-27T06:59:18Z | |
dc.date.available | 2016-07-27T06:59:18Z | |
dc.date.issued | 2005 | |
dc.identifier.citation | Erciyeş, 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_16 | en_US |
dc.identifier.issn | 0302-9743 | |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.issn | 1611-3349 | - |
dc.identifier.uri | http://doi.org/10.1007/978-3-540-30577-4_16 | |
dc.identifier.uri | http://hdl.handle.net/11147/1982 | |
dc.description | 31st Conference on Current Trends in Theory and Practice of Computer Science; Liptovsky Jan; Slovakia; 22 January 2005 through 28 January 2005 | en_US |
dc.description.abstract | We 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.iso | en | en_US |
dc.publisher | Springer Verlag | en_US |
dc.relation.ispartof | Lecture Notes in Computer Science | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Costs | en_US |
dc.subject | Graph theory | en_US |
dc.subject | Partitioning | en_US |
dc.subject | Parallel algorithm | en_US |
dc.title | Serial and parallel multilevel graph partitioning using fixed centers | en_US |
dc.type | Conference Object | en_US |
dc.authorid | TR125627 | en_US |
dc.institutionauthor | Erciyeş, Kayhan | - |
dc.department | İzmir Institute of Technology. Computer Engineering | en_US |
dc.identifier.volume | 3381 | en_US |
dc.identifier.startpage | 127 | en_US |
dc.identifier.endpage | 136 | en_US |
dc.identifier.wos | WOS:000228554400016 | en_US |
dc.identifier.scopus | 2-s2.0-24144466383 | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.identifier.doi | 10.1007/978-3-540-30577-4_16 | - |
dc.relation.doi | 10.1007/978-3-540-30577-4_16 | en_US |
dc.coverage.doi | 10.1007/978-3-540-30577-4_16 | en_US |
dc.identifier.wosquality | N/A | - |
dc.identifier.scopusquality | Q3 | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.grantfulltext | open | - |
item.cerifentitytype | Publications | - |
item.openairetype | Conference Object | - |
item.languageiso639-1 | en | - |
item.fulltext | With Fulltext | - |
crisitem.author.dept | 03.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 |
CORE Recommender
SCOPUSTM
Citations
5
checked on Aug 23, 2024
WEB OF SCIENCETM
Citations
3
checked on Aug 24, 2024
Page view(s)
274
checked on Aug 26, 2024
Download(s)
250
checked on Aug 26, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.