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

 
9786132747433: Maximum flow problem: Optimization (mathematics), Flow network, Cut (graph theory), Max-flow min-cut theorem, Ford-Fulkerson algorithm
Softcover
ISBN 10: 6132747435 ISBN 13: 9786132747433
Verlag: OmniScriptum, 2010

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
OmniScriptum
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
6132747435
ISBN 13 
9786132747433
Einband
Tapa blanda
Anzahl der Seiten
76
Herausgeber
Miller Frederic P., Vandome Agnes F., McBrewster John
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar