Frutex y caminos nodales
ISSN: 0041-0241
Year of publication: 1981
Volume: 32
Issue: 3
Pages: 67-93
Type: Article
More publications in: Trabajos de estadística e investigación operativa
Abstract
Let G = (X,E) be a graph with only one unsaturated vertex p; it is studied the problem of finding, for every x Î X, an M-alternating even path joining x to p. We get an algorithm, and it is sketched its application to give a modification of Edmond's Algorithm in which shrinkage of pseudovertices is not needed