BOOLEAN-ALGEBRA METHOD FOR COMPUTING TERMINAL RELIABILITY IN A COMMUNICATION NETWORK

被引：142

作者：

FRATTA, L

MONTANARI, UG

机构：

[1] POLTEC MILAN, IST ELETTROTEC & ELETR, MILAN, ITALY

[2] CONSIGLIO NAZL RICERCHE, IST ELABORAZIONE INFORMAZIONE, PISA, ITALY

来源：

IEEE TRANSACTIONS ON CIRCUIT THEORY | 1973年 / CT20卷 / 03期

关键词：

D O I：

10.1109/TCT.1973.1083657

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

引用

页码：203 / 211

页数：9

共 16 条

BROWN, DB .

[2] ON FINDING SIMPLE PATHS AND CIRCUITS IN A GRAPH [J].

DANIELSON, GH .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1968, CT15 (03) :294-+

[3] ANALYSIS AND DESIGN OF SURVIVABLE NETWORKS [J].

FRANK, H ;

FRISCH, IT .

IEEE TRANSACTIONS ON COMMUNICATION TECHNOLOGY, 1970, CO18 (05) :501-&

[4]

FRANK H, 1971, COMMUNICATION TRANSM

[5]

FRATTA L, 1972, 2 P INT S NETW THEOR, P391

[6]

FRATTA L, B7111 IEI TECH NOT

[7]

HANSLER E, 1971, AEU-ARCH ELEKTRON UB, V25, P573

[8] ALL PATHS THROUGH A MAZE [J].

KROFT, D .

PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1967, 55 (01) :88-&

[9] ANALYSIS OF SWITCHING NETWORKS [J].

LEE, CY .

BELL SYSTEM TECHNICAL JOURNAL, 1955, 34 (06) :1287-1315

[10]

LIN PM, 1969, 7TH P ALL C CIRC SYS, P196