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

Prijzen vanaf
95,35

Uitgelicht

VERGELIJK ALLE AANBIEDERS (2)

Beschrijving

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

Description Beschrijving
Product Specifications Productspecificaties
Gerelateerde resultaten Gerelateerde resultaten
Next
Previous

Vergelijk aanbieders (2)

Shop
Prijs
Verzendkosten
Totale prijs
Amazon Logo
95,35
Gratis
95,35
Naar shop
Gratis Shipping Costs
Amazon Marketplace Logo
95,35
Gratis
95,35
Naar shop
Gratis Shipping Costs
Beschrijving (0)

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

Productspecificaties

Merk OmniScriptum
EAN
  • 9786132838285

OmniScriptum

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

138,54
Vergelijk 2 shops 2 shops

OmniScriptum

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

138,54
Vergelijk 2 shops 2 shops

The Graph Isomorphism Problem

79,67
Meer informatie Meer info

OmniScriptum

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

95,35
Vergelijk 2 shops 2 shops
Uitgelichte Keuze
95,35
Naar shop