Pathfinding through a communication network
- 1 January 1967
- journal article
- Published by Institution of Engineering and Technology (IET) in Proceedings of the Institution of Electrical Engineers
- Vol. 114 (1) , 76-78
- https://doi.org/10.1049/piee.1967.0009
Abstract
A technique is proposed by which all paths of exactly q branches interconnecting a given source-sink node pair can be obtained. Using the proposed technique, paths of increasing length can be found sequentially. The method is based on a symbolic noncommutative multiplication among the entries of an Nmatrix which is a modified version of the vertex adjacency matrix.Keywords
This publication has 2 references indexed in Scilit:
- The theory of switching netsIEEE Transactions on Information Theory, 1959
- Minimization of Boolean Functions*Bell System Technical Journal, 1956