Optimal Mixed Graph Augmentation
Dan Gusfield · SIAM Journal on Computing · 1987
In this paper we consider an augmentation problem on mixed graphs that generalizes and unifies two augmentation problems considered by Eswaran and Tarjan [this Journal, 5 (1976), pp. 653–665]. The mixed augmentation problem has applications in the design of communication networks, and forms of the mixed augmentation problem are central in statistical data security problems discussed in [Yale Univ. Tech. Report, August 1984]. We solve the augmentation problem on mixed graphs in time linear in the number of edges of the graph, the same time bound obtained in [ET] for each of the two special cases.