Title :
Pathfinding through a communication network
Author_Institution :
College of Engineering, Haile Selassie I University, Department of Electrical Engineering, Addis Ababa, Ethiopia
fDate :
1/1/1967 12:00:00 AM
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 :
information theory; telegraph networks; telephone networks;
Journal_Title :
Electrical Engineers, Proceedings of the Institution of
DOI :
10.1049/piee.1967.0009
