Misra, R. B. ; Misra, Krishna B. (1980) Enumeration of all simple paths in a communication network Microelectronics and Reliability, 20 (4). pp. 419-426. ISSN 0026-2714
Full text not available from this repository.
Official URL: http://linkinghub.elsevier.com/retrieve/pii/002627...
Related URL: http://dx.doi.org/10.1016/0026-2714(80)90584-3
Abstract
An algorithm has been developed for enumerating all simple paths in a communication network for specified terminal pairs. The efficiency of the method increases with the number of terminal pairs for which path enumeration is required. The algorithm generates the paths in ascending order of cardinality. The method is applicable to the graphs having finite non zero failure probability nodes. A FORTRAN program for implementation of the algorithm has been developed and results are reported.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| ID Code: | 19999 |
| Deposited On: | 20 Nov 2010 15:11 |
| Last Modified: | 07 Jun 2011 06:57 |
Repository Staff Only: item control page
