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

Prices from
108.41

Featured

COMPARE ALL WEBSHOPS (2)

Description

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

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

Compare webshops (2)

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

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

Product specifications

Brand OmniScriptum
EAN
  • 9786132745323

OmniScriptum

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

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

Maximum Common Subgraph Isomorphism Problem: Computational complexity theory, Optimization problem, NP-hard, Graph...

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

Maximum satisfiability Problem: Computational complexity theory, Propositional formula, NP hard, Boolean problem, complete, APX

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

Connectivity (graph Theory): Mathematics, Computer science, Graph theory, Flow network, Undirected graph,...

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