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

 
9786132747433: Maximum flow problem: Optimization (mathematics), Flow network, Cut (graph theory), Max-flow min-cut theorem, Ford–Fulkerson algorithm
Brossura
ISBN 10: 6132747435 ISBN 13: 9786132747433
Casa editrice: Alphascript Publishing, 2010

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Editore
Alphascript Publishing
Data di pubblicazione
2010
Lingua
Inglese
ISBN 10 
6132747435
ISBN 13 
9786132747433
Rilegatura
Copertina flessibile
Numero di pagine
76
Redattore
Miller Frederic P., Vandome Agnes F., McBrewster John
Contatto del produttore
non disponibile
Persona responsabile
non disponibile