Programming in networks and graphs : on the combinatorial background and near-equivalence of network flow and matching algorithms /

Network flow and matching are often treated separately in the literature and for each class a variety of different algorithms has been developed. These algorithms are usually classified as primal, dual, primal-dual etc. The question the author addresses in this work is that of the existence of a com...

Full description

Bibliographic Details

Main Author:	Derigs, Ulrich, 1950-
Corporate Author:	SpringerLink (Online service)
Format:	eBook
Language:	English
Published:	Berlin ; New York : Springer-Verlag, [1988]
Series:	Lecture notes in economics and mathematical systems ; 300.
Subjects:	Combinatorial optimization. Network analysis (Planning) Matching theory. Electronic books.
Online Access:	Connect to the full text of this electronic book