HARDWARE APPROACH FOR GENERATING SPANNING-TREES IN RELIABILITY STUDIES

被引:2
|
作者
BANSAL, VK
MISRA, KB
机构
来源
MICROELECTRONICS AND RELIABILITY | 1981年 / 21卷 / 02期
关键词
D O I
10.1016/0026-2714(81)90397-8
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
引用
收藏
页码:243 / 253
页数:11
相关论文
共 50 条
  • [21] ON THE NUMBER OF SPANNING-TREES IN FULLERENES
    MIHALIC, Z
    TRINAJSTIC, N
    FULLERENE SCIENCE AND TECHNOLOGY, 1994, 2 (01): : 89 - 95
  • [22] THE NUMBER OF SPANNING-TREES IN BUCKMINSTERFULLERENE
    BROWN, TJN
    MALLION, RB
    POLLAK, P
    DECASTRO, BRM
    GOMES, JANF
    JOURNAL OF COMPUTATIONAL CHEMISTRY, 1991, 12 (09) : 1118 - 1124
  • [23] ON SPANNING-TREES IN CATACONDENSED MOLECULES
    GUTMAN, I
    MALLION, RB
    ZEITSCHRIFT FUR NATURFORSCHUNG SECTION A-A JOURNAL OF PHYSICAL SCIENCES, 1993, 48 (10): : 1026 - 1030
  • [24] ON THE SPANNING-TREES OF WEIGHTED GRAPHS
    MAYR, EW
    PLAXTON, CG
    COMBINATORICA, 1992, 12 (04) : 433 - 447
  • [25] A PETRI NET APPROACH TO DETERMINE ALL SPANNING-TREES FOR OVERALL RELIABILITY-ANALYSIS OF GENERAL NETWORKS
    KUMAR, V
    AGGARWAL, KK
    RELIABILITY ENGINEERING & SYSTEM SAFETY, 1989, 25 (03) : 283 - 291
  • [26] GRAPHS WITH CERTAIN FAMILIES OF SPANNING-TREES
    ERDOS, P
    FAUDREE, RJ
    ROUSSEAU, CC
    SCHELP, RH
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1982, 32 (02) : 162 - 170
  • [27] NEW ALGORITHM FOR GENERATION OF SPANNING-TREES
    CHERKASSKII, BV
    CYBERNETICS, 1987, 23 (01): : 107 - 113
  • [28] SPANNING-TREES OF LOCALLY FINITE GRAPHS
    ZELINKA, B
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 1989, 39 (02) : 193 - 197
  • [29] MOST AND LEAST UNIFORM SPANNING-TREES
    CAMERINI, PM
    MAFFIOLI, F
    MARTELLO, S
    TOTH, P
    DISCRETE APPLIED MATHEMATICS, 1986, 15 (2-3) : 181 - 197
  • [30] APPLICATION OF MINIMAL SPANNING-TREES IN GLIOMA GRADING - A CLIPPER PROGRAM FOR THE CALCULATION AND CONSTRUCTION OF MINIMAL SPANNING-TREES
    KOLLES, H
    LUDT, H
    VINCE, GH
    FEIDEN, W
    COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE, 1994, 42 (03) : 201 - 206