An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model

被引：0
|
作者：
Department of Computer Science and Engineering, IIT, Kanpur, India [1 ]
不详 [2 ]
机构：
来源：
Algorithmica | / 3卷 / 967-985期
基金：
以色列科学基金会;
关键词：
Building blockes - Classical techniques - Depth first search algorithms - Dynamic maintenances - Fault tolerant model - Fault-tolerant - Preprocessing phase - Strongly connected component;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
37
引用
下载
收藏
相关论文
共 50 条
  • [21] A greedy algorithm for the fault-tolerant connected dominating set in a general graph
    Jiao Zhou
    Zhao Zhang
    Weili Wu
    Kai Xing
    Journal of Combinatorial Optimization, 2014, 28 : 310 - 319
  • [22] An efficient and fault-tolerant update commitment protocol for weakly connected replicas
    Barreto, J
    Ferreira, P
    EURO-PAR 2005 PARALLEL PROCESSING, PROCEEDINGS, 2005, 3648 : 1059 - 1068
  • [23] FAULT-TOLERANT DISTRIBUTED BROADCAST ALGORITHM FOR CUBE-CONNECTED-CYCLES
    WU, J
    FERNANDEZ, EB
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 1993, 8 (04): : 224 - 233
  • [24] A greedy algorithm for the fault-tolerant connected dominating set in a general graph
    Zhou, Jiao
    Zhang, Zhao
    Wu, Weili
    Xing, Kai
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 28 (01) : 310 - 319
  • [25] A Granulation Strategy-Based Algorithm for Computing Strongly Connected Components in Parallel
    He, Huixing
    Xu, Taihua
    Chen, Jianjun
    Cui, Yun
    Song, Jingjing
    MATHEMATICS, 2024, 12 (11)
  • [26] A map-reduce algorithm to find strongly connected components of directed graphs
    Ji, Fujun
    Jin, Jidong
    Soft Computing, 2025, 29 (04) : 1947 - 1966
  • [27] Efficient scan mask techniques for connected components labeling algorithm
    Phaisarn Sutheebanjard
    Wichian Premchaiswadi
    EURASIP Journal on Image and Video Processing, 2011
  • [28] On identifying strongly connected components in parallel
    Fleischer, LK
    Hendrickson, B
    Pinar, A
    PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 2000, 1800 : 505 - 511
  • [29] Efficient algorithm to compute mutually connected components in interdependent networks
    Hwang, S.
    Choi, S.
    Lee, Deokjae
    Kahng, B.
    PHYSICAL REVIEW E, 2015, 91 (02)
  • [30] Finding strongly connected components in parallel
    Pogorilyy, S. D.
    Lozytskyi, S., I
    APPLIED AND COMPUTATIONAL MATHEMATICS, 2007, 6 (02) : 236 - 245
12345