Maximum flow problem: Optimization (mathematics), Flow network, Cut (graph theory), Max-flow min-cut theorem, Ford–Fulkerson algorithm - Couverture souple

 
9786132747433: Maximum flow problem: Optimization (mathematics), Flow network, Cut (graph theory), Max-flow min-cut theorem, Ford–Fulkerson algorithm
Couverture souple
ISBN 10 : 6132747435 ISBN 13 : 9786132747433
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 maximum flow problem is to find a feasible flow through a single-source, single-sink flow network that is maximum. The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem. The maximum value of an s-t flow is equal to the minimum capacity of an s-t cut in the network, as stated in the max-flow min-cut theorem.

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

Présentation de l'éditeur

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In optimization theory, the maximum flow problem is to find a feasible flow through a single-source, single-sink flow network that is maximum. The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem. The maximum value of an s-t flow is equal to the minimum capacity of an s-t cut in the network, as stated in the max-flow min-cut theorem.

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

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