Parallel Connectivity Algorithms
| dc.contributor.author | Kayhan Erciyeş | |
| dc.contributor.author | Behcet Melih Saribatir | |
| dc.contributor.author | Erciyes, Kayhan | |
| dc.contributor.author | Saribatir, Behcet Melih | |
| dc.contributor.editor | A. Varol , M. Karabatak , C. Varol | |
| dc.date.accessioned | 2025-10-06T17:50:07Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | We propose and implement two parallel algorithms to test the connectivity and find the connected components of a network in parallel. In both cases the connectivity matrix of the graph is partitioned to p processors. The first parallel algorithm (Alg. 2) processors test connectivity in their partitions and then cooperate to decide. The second parallel algorithm (Alg. 4) forms a labelled connectivity matrix and then partitions this matrix to processors to find the components of a disconnected graph. We show both algorithms achieve significant speedups even with only few processors. © 2023 Elsevier B.V. All rights reserved. | |
| dc.identifier.doi | 10.1109/IISEC56263.2022.9998283 | |
| dc.identifier.isbn | 9781665459952 | |
| dc.identifier.scopus | 2-s2.0-85146369681 | |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85146369681&doi=10.1109%2FIISEC56263.2022.9998283&partnerID=40&md5=f964662389e6df35e3e6f8691c0daa0e | |
| dc.identifier.uri | https://gcris.yasar.edu.tr/handle/123456789/8766 | |
| dc.identifier.uri | https://doi.org/10.1109/IISEC56263.2022.9998283 | |
| dc.language.iso | English | |
| dc.publisher | Institute of Electrical and Electronics Engineers Inc. | |
| dc.relation.ispartof | 3rd International Informatics and Software Engineering Conference IISEC 2022 | |
| dc.rights | info:eu-repo/semantics/closedAccess | |
| dc.subject | Connected Component, Connectivity, Network, Parallel Processing Systems, Connected Component, Connectivity, Connectivity Algorithms, Connectivity Matrix, Disconnected Graph, Network, Processor Test, Parallel Algorithms | |
| dc.subject | Parallel processing systems, Connected component, Connectivity, Connectivity algorithms, Connectivity matrix, Disconnected graph, Network, Processor test, Parallel algorithms | |
| dc.subject | Connectivity | |
| dc.subject | Connected Component | |
| dc.subject | Network | |
| dc.title | Parallel Connectivity Algorithms | |
| dc.type | Conference Object | |
| dspace.entity.type | Publication | |
| gdc.author.scopusid | 6508176126 | |
| gdc.author.scopusid | 22333270800 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | ||
| gdc.description.departmenttemp | [Erciyes K.] Yaşar University, Computer Engineering Dept., İzmir, Turkey; [Saribatir B.M.] Yaşar University, Computer Engineering Dept., İzmir, Turkey | |
| gdc.description.endpage | 6 | |
| gdc.description.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | |
| gdc.description.startpage | 1 | |
| gdc.identifier.openalex | W4313343618 | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 0.0 | |
| gdc.oaire.influence | 2.3811355E-9 | |
| gdc.oaire.isgreen | false | |
| gdc.oaire.popularity | 1.6828513E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 0.0 | |
| gdc.openalex.normalizedpercentile | 0.18 | |
| gdc.opencitations.count | 0 | |
| gdc.plumx.scopuscites | 0 | |
| gdc.scopus.citedcount | 0 | |
| gdc.virtual.author | Saribatir, Behçet Melih | |
| person.identifier.scopus-author-id | Erciyeş- Kayhan (22333270800), Saribatir- Behcet Melih (6508176126) | |
| relation.isAuthorOfPublication | a5a6082d-c9c3-4753-8101-73bd392d54dd | |
| relation.isAuthorOfPublication.latestForDiscovery | a5a6082d-c9c3-4753-8101-73bd392d54dd | |
| relation.isOrgUnitOfPublication | ac5ddece-c76d-476d-ab30-e4d3029dee37 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | ac5ddece-c76d-476d-ab30-e4d3029dee37 |