Linear-time algorithm to find modules of fault trees

被引：0
|
作者：
Universite Bordeaux I, Talence, France [1 ]
机构：
来源：
IEEE Trans Reliab | / 3卷 / 422-425期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] A linear-time algorithm to find modules of fault trees
    Dutuit, Y
    Rauzy, A
    [J]. IEEE TRANSACTIONS ON RELIABILITY, 1996, 45 (03) : 422 - 425
  • [2] Randomized linear-time algorithm to find minimum spanning trees
    Stanford Univ, Stanford, United States
    [J]. J Assoc Comput Mach, 2 (321-328):
  • [3] A RANDOMIZED LINEAR-TIME ALGORITHM TO FIND MINIMUM SPANNING-TREES
    KARGER, DR
    KLEIN, PN
    TARJAN, RE
    [J]. JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, 1995, 42 (02): : 321 - 328
  • [4] A linear-time algorithm to find independent spanning trees in maximal planar graphs
    Nagai, S
    Nakano, S
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2001, E84A (05): : 1102 - 1109
  • [5] A linear-time algorithm to find independent spanning trees in maximal planar graphs
    Nagai, S.
    Nakano, S.-I.
    [J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2001, E84-A (05) : 1102 - 1109
  • [6] Linear-time algorithm for the generation of trees
    [J]. Algorithmica (New York), 1997, 17 (02):
  • [7] A linear-time algorithm for the generation of trees
    Alonso, L
    Remy, JL
    Schott, R
    [J]. ALGORITHMICA, 1997, 17 (02) : 162 - 182
  • [8] A linear-time algorithm for the generation of trees
    L. Alonso
    J. L. Rémy
    R. Schott
    [J]. Algorithmica, 1997, 17 : 162 - 182
  • [9] Linear-time algorithm for sliding tokens on trees
    Demaine, Erik D.
    Demaine, Martin L.
    Fox-Epstein, Eli
    Hoang, Duc A.
    Ito, Takehiro
    Ono, Hirotaka
    Otachic, Yota
    Uehara, Ryuhei
    Yamada, Takeshi
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 600 : 132 - 142
  • [10] Method to find modules of fault trees
    Yan, Jianping
    [J]. Beifang Jiaotong Daxue Xuebao/Journal of Northern Jiaotong University, 2000, 24 (05): : 63 - 66
12345