|
|
|
|
|
Candido Ferreira Xavier de Mendonça Neto, Peter Eades (Author)
Pág. 841 - 845
Given a directed graph G, a covering is a subset B of arcs which meets all directed cuts of G. Equivalently, the contraction of the elements of B makes G strongly connected. An O(n5) primal-dual algorithm is presented by Frank (1981) for finding a minimu...
ver más
|
|
|
|
|