Showing papers by "Yi Chen published in 1966"
TL;DR: In this article, a number of interesting properties of a cycle free directed graph are presented by making use of these properties an efficient algorithm is deduced which identifies the longest path, or the Hamiltonian path of any, between every pair of vertices.
Abstract: A number of interesting properties of a cycle free directed graph are presented By making use of these properties an efficient algorithm is deduced which identifies the longest path, or the Hamiltonian path of any, between every pair of vertices. The properties are expressed in terms of the “terminal connection matrix” which compactly describes the connectedness of the graph. Examples of practical applications of the results are given.
2 citations