An algorithm for enumerating all simple paths in a communication network-Reference-Cited by-同舟云学术

An algorithm for enumerating all simple paths in a communication network

Published:1979-01 Issue:4 Volume:19 Page:363-366
ISSN:0026-2714
Container-title:Microelectronics Reliability
language:en
Short-container-title:Microelectronics Reliability

Author:

Misra R.B.

Publisher

Elsevier BV

Subject

Electrical and Electronic Engineering,Surfaces, Coatings and Films,Safety, Risk, Reliability and Quality,Condensed Matter Physics,Atomic and Molecular Physics, and Optics,Electronic, Optical and Magnetic Materials

Reference4 articles.

1. Graph Theory with Applications to Engineering and Computer Science;Narsingh,1974

2. Graph Theory in Modern Engineering;Henley,1973

3. Symbolic network functions by a simple path finding algorithm;Lin,1968

4. A Boolean algebra method for computing the terminal reliability in a communication network;Fratta;IEEE Trans. Circuit Theory,1973

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An efficient sum of disjoint product method for reliability evaluation of stochastic flow networks using d-MPs;International Journal of System Assurance Engineering and Management;2023-06-11

2. References;Interconnection Network Reliability Evaluation;2020-09-21

3. Entropy as a measure of centrality in networks characterized by path-transfer flow;Social Networks;2007-05

4. An algorithm to generate all spanning trees with flow;Mathematical and Computer Modelling;2002-06

5. Heuristics for Similarity Searching of Chemical Graphs Using a Maximum Common Edge Subgraph Algorithm;Journal of Chemical Information and Computer Sciences;2002-02-09