scholarly journals Group connectivity under 3‐edge‐connectivity

2020 ◽  
Author(s):  
Miaomiao Han ◽  
Jiaao Li ◽  
Xueliang Li ◽  
Meiling Wang
2021 ◽  
Vol 37 (3) ◽  
pp. 1013-1023
Author(s):  
J. Leaños ◽  
Christophe Ndjatchi
Keyword(s):  

Author(s):  
Sinan G. Aksoy ◽  
Mark Kempton ◽  
Stephen J. Young

2006 ◽  
Vol 17 (03) ◽  
pp. 677-701 ◽  
Author(s):  
YUNG H. TSIN

A distributed algorithm for finding the cut-edges and the 3-edge-connected components of an asynchronous computer network is presented. For a network with n nodes and m links, the algorithm has worst-case [Formula: see text] time and O(m + nhT) message complexity, where hT < n. The algorithm is message optimal when [Formula: see text] which includes dense networks (i.e. m ∈ Θ(n2)). The previously best known distributed algorithm has a worst-case O(n3) time and message complexity.


2019 ◽  
Vol 93 (3) ◽  
pp. 317-327 ◽  
Author(s):  
Radek Hušek ◽  
Lucie Mohelníková ◽  
Robert Šámal
Keyword(s):  

2003 ◽  
Vol 269 (1-3) ◽  
pp. 13-20 ◽  
Author(s):  
Camino Balbuena ◽  
Daniela Ferrero
Keyword(s):  

2016 ◽  
Vol 32 (6) ◽  
pp. 2575-2589
Author(s):  
Seongmin Ok ◽  
R. Bruce Richter ◽  
Carsten Thomassen

Sign in / Sign up

Export Citation Format

Share Document