Abstract
We define the optimal generalized inverse of the directed graph, give its construction and prove that the graph has an inverse graph iff its optimal generalized inverse is its inverse. The construction of the optimal generalized inverse may be used in the preparation of the PERT networks by the computer.
Get full access to this article
View all access options for this article.