Max-Flow min-cut Theorem: Optimization (mathematics), Flow network, Glossary of graph theory, Linear programming, König's theorem (graph theory), Menger's theorem - Couverture souple

 
9786131769658: Max-Flow min-cut Theorem: Optimization (mathematics), Flow network, Glossary of graph theory, Linear programming, König's theorem (graph theory), Menger's theorem
Couverture souple
ISBN 10 : 6131769656 ISBN 13 : 9786131769658
Editeur : Alphascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In optimization theory, the max-flow min-cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum capacity that needs to be removed from the network so that no flow can pass from the source to the sink. The max-flow min-cut theorem is a special case of the duality theorem and can be used to derive the Menger''s theorem and the König-Egerváry Theorem.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Éditeur
Alphascript Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
6131769656
ISBN 13 
9786131769658
Reliure
Broché
Nombre de pages
72
Éditeur
Miller Frederic P., Vandome Agnes F., McBrewster John
Coordonnées du fabricant
non disponible
Personne responsable
non disponible