Title :
Fast algorithm for finding a forest of a linear graph
Author :
Jovanovich, Antonije D. ; Chobeljich, Srdjan N.
Author_Institution :
University of Belgrade, Faculty of Electrical Engineering, Belgrade, Yugoslavia
Abstract :
A new algorithm is described for finding a tree of a connected, or a forest of an unconnected, linear graph. The algorithm is found to be the fastest of known algorithms having the same minimal storage requirements. A short comparison of the algorithm with some other algorithms is included.
Keywords :
graph theory; trees (mathematical); fast algorithm; graph theory; trees (mathematical;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19730372
