Kayhan ErciyeşBehcet Melih SaribatirErciyes, KayhanSaribatir, Behcet MelihA. Varol , M. Karabatak , C. Varol2025-10-062022978166545995210.1109/IISEC56263.2022.99982832-s2.0-85146369681https://www.scopus.com/inward/record.uri?eid=2-s2.0-85146369681&doi=10.1109%2FIISEC56263.2022.9998283&partnerID=40&md5=f964662389e6df35e3e6f8691c0daa0ehttps://gcris.yasar.edu.tr/handle/123456789/8766https://doi.org/10.1109/IISEC56263.2022.9998283We 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.Englishinfo:eu-repo/semantics/closedAccessConnected Component, Connectivity, Network, Parallel Processing Systems, Connected Component, Connectivity, Connectivity Algorithms, Connectivity Matrix, Disconnected Graph, Network, Processor Test, Parallel AlgorithmsParallel processing systems, Connected component, Connectivity, Connectivity algorithms, Connectivity matrix, Disconnected graph, Network, Processor test, Parallel algorithmsConnectivityConnected ComponentNetworkConference Object