Maximum Common Subgraph Isomorphism Problem: Computational complexity theory, Optimization problem, NP-hard, Graph Isomorphism, Decision NP-complete, Modular product of graphs

Prices from
127.10

Featured

COMPARE ALL WEBSHOPS (2)

Description

Maximum Common Subgraph Isomorphism Problem: Computational complexity theory, Optimization problem, NP-hard, Graph Isomorphism, Decision NP-complete, Modular product of graphs

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 Common Subgraph Isomorphism Problem: Computational complexity theory, Optimization problem, NP-hard, Graph Isomorphism, Decision NP-complete, Modular product of graphs

Product specifications

Brand OmniScriptum
EAN
  • 9786132838285

OmniScriptum

Graph homomorphism: theory, Subgraph, isomorphism problem, isomorphism, Inverse function, coloring, Tensor product of graphs

€ 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

Promise Problem: Computational Complexity Theory, Decision Problem, Hamiltonian Graph

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

Pseudo-Polynomial Time: Computational Complexity Theory, Time Complexity, NP-Complete, NP-Hard

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