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

Prices from
127.10

Featured

COMPARE ALL WEBSHOPS (2)

Description

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

Description Description
Product Specifications Product specifications
Related results Related results
Next
Previous

Compare webshops (2)

Shop
Price
Amazon Logo
€ 127.10
To Shop
Amazon Marketplace Logo
€ 127.10
To Shop
Description (0)

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

Product specifications

Brand OmniScriptum
EAN
  • 9786132747433

OmniScriptum

Max-Flow min-cut Theorem: Optimization (mathematics), Flow network, Glossary of graph theory, Linear...

€ 108.41
Compare 2 stores 2 stores

OmniScriptum

Hall's Theorem: Philip Hall, Combinatorics, König's theorem (graph theory), Doubly stochastic matrix,...

€ 108.41
Compare 2 stores 2 stores

OmniScriptum

Maximum Cut: Graph (mathematics), Cut (graph theory), Decision problem, Theoretical computer science, NP-complete, 2-satisfiability

€ 108.41
Compare 2 stores 2 stores

OmniScriptum

Cooperative diversity: Channel capacity, Antenna diversity, state information, Max-flow min-cut theorem, Mesh...

€ 108.41
Compare 2 stores 2 stores
Featured Choice
€ 127.10
To Shop