Based on the algorithm to find strongly connected nodes of a graph, this paper presents a lineartimealgorithm to detect modules of a fault tree.
基于在图中寻找强连接节点的算法，给出一种线性时间复杂度算法来检测故障树中的模块。
2
The Sequitur compression algorithm is a linear-time online algorithm that forms a context-free grammar for a given string input.
Sequitur压缩算法是线性时间在线算法，为给定的字符串输入生成了一种与上下文无关的语法。
3
The running time of the algorithm is linear. Simulation results show that the time steps of the algorithm are very close to the network diameter in practice.