Serial and Parallel Multilevel Graph Partitioning Using Fixed Centers
| dc.contributor.author | Erciyeş, Kayhan | |
| dc.contributor.author | Alp, Ali | |
| dc.contributor.author | Marshall, Geoffrey | |
| dc.coverage.doi | 10.1007/978-3-540-30577-4_16 | |
| dc.date.accessioned | 2016-07-27T06:59:18Z | |
| dc.date.available | 2016-07-27T06:59:18Z | |
| dc.date.issued | 2005 | |
| 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.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.doi | 10.1007/978-3-540-30577-4_16 | |
| dc.identifier.doi | 10.1007/978-3-540-30577-4_16 | en_US |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.scopus | 2-s2.0-24144466383 | |
| dc.identifier.uri | http://doi.org/10.1007/978-3-540-30577-4_16 | |
| dc.identifier.uri | https://hdl.handle.net/11147/1982 | |
| 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 |
| dspace.entity.type | Publication | |
| gdc.author.institutional | Erciyeş, Kayhan | |
| gdc.author.yokid | 125627 | |
| gdc.author.yokid | 125627 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.access | open access | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | İzmir Institute of Technology. Computer Engineering | en_US |
| gdc.description.endpage | 136 | en_US |
| gdc.description.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q3 | |
| gdc.description.startpage | 127 | en_US |
| gdc.description.volume | 3381 | en_US |
| gdc.description.wosquality | N/A | |
| gdc.identifier.openalex | W1593241569 | |
| gdc.identifier.wos | WOS:000228554400016 | |
| gdc.index.type | WoS | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 0.0 | |
| gdc.oaire.influence | 2.7888685E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.keywords | Graph theory | |
| gdc.oaire.keywords | Parallel algorithm | |
| gdc.oaire.keywords | Algorithms | |
| gdc.oaire.keywords | Partitioning | |
| gdc.oaire.keywords | Costs | |
| gdc.oaire.popularity | 4.2426956E-10 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0202 electrical engineering, electronic engineering, information engineering | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.oaire.sciencefields | 0101 mathematics | |
| gdc.oaire.sciencefields | 01 natural sciences | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 0.0 | |
| gdc.openalex.normalizedpercentile | 0.1 | |
| gdc.opencitations.count | 2 | |
| gdc.plumx.crossrefcites | 2 | |
| gdc.plumx.mendeley | 7 | |
| gdc.plumx.scopuscites | 5 | |
| gdc.scopus.citedcount | 5 | |
| gdc.wos.citedcount | 3 | |
| relation.isAuthorOfPublication.latestForDiscovery | fbb306f8-ddf0-45db-8f73-d66feca793c2 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | 9af2b05f-28ac-4014-8abe-a4dfe192da5e |