Abstract
For a connected graph G, a set S of edges (vertices) is a cyclic edge (vertex) cutset if G - S is not connected and at least two components contain a cycle respectively. The cyclic edge (vertex) connectivity cλ (κ) is the cardinality of a minimum cyclic edge (vertex) cutset. In this paper, we gave distributed algorithms determining cyclic edge connectivity and cyclic vertex connectivity of cubic graphs. The experiment results showed that the distributed algorithms were significantly improved in time compared to the original algorithms when the graph was large. Time costs of the distributed algorithms separately for cyclic edge connectivity and cyclic vertex connectivity are correspondingly less than 33% and less than 40% that of the single machine algorithms when the graph was large enough.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
