𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some properties of cycle-free directed graphs and the identification of the longest path

✍ Scribed by Y.C. Chen; O. Wing

Publisher
Elsevier Science
Year
1966
Tongue
English
Weight
444 KB
Volume
281
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

✦ Synopsis

XBSTRACT: A number of interesting properties of a cycle-free directed graph are presented By making use of these properties an e.Oicient algorithm is deduced which identifies the longest path, or the Hamiltonian path if 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. of The Franklin

Institute

Some Properties of Cycle-Free Directed Graphs

Cycle-free directed graphs play an important role in operations research on problems related to scheduling (2), critical paths (3), and project networks (4). In most problems, the determination of the longest path and the Hamiltonian path is of interest.

πŸ“œ SIMILAR VOLUMES

Free and Wilson correlation between the
Free and Wilson correlation between the molecular structure of some imidazolines and their corrosion inhibiting properties
✍ P. Dupin; A. de Savignac; A. Lattes πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 German βš– 348 KB

## Abstract In deaerated media containing hydrogen sulfide, the inhibition of the corrosion of N 80 steel by a homologous series of imidazolines was measured potentiokinetically. The data obtained were correlated to the structure of these molecules by means of __Free__ and __Wilson__ relationships.