Title :
Generation of all Cutsets of a Bipath Network
Author_Institution :
Faculty of Engineering, Univ. of Waterloo, Waterloo, Ont., Canada
fDate :
12/1/1973 12:00:00 AM
Abstract :
An algorithm to find the Hamiltonian circuit in a bipath network is developed. Using the Hamiltonian circuit all cutsets of a bipath network are generated from incidence sets in a systematic way without duplication. Also it is shown that the algorithm to find the Hamiltonian circuit can be used to test a graph for bipathness.
Keywords :
Communication networks; Channel capacity; Circuit testing; Circuit topology; Communication networks; Communications Society; Computer networks; Councils; Design optimization; Mathematical programming; Network topology;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOM.1973.1091598
