𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear-time algorithm to find modules of fault trees

✍ Scribed by Dutuit, Y.; Rauzy, A.

Book ID
114555561
Publisher
IEEE
Year
1996
Tongue
English
Weight
376 KB
Volume
45
Category
Article
ISSN
0018-9529

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Linear Time Algorithm for Finding ak-T
A Linear Time Algorithm for Finding ak-Tree Core
✍ Akiyoshi Shioura; Takeaki Uno πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 173 KB

Given a tree containing n vertices, consider the sum of the distance between all Ε½ . vertices and a k-leaf subtree subtree which contains exactly k leaves . A k-tree core is a k-leaf subtree which minimizes the sum of the distances. In this paper, we propose a linear time algorithm for finding a k-t

A linear time algorithm for finding dept
A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
✍ Hon-Chan Chen; Yue-Li Wang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 458 KB

Let G be a connected graph of n vertices and m edges. The problem of finding a depth-first spanning tree of G is to find a subgraph of G connecting the n vertices with n -1 edges by depth-first search. In this paper, we propose an O(n) time algorithm for solving this problem on trapezoid graphs. Our