OmniScriptum

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

Name: Maximum Common Subgraph Isomorphism Problem: Computational complexity theory, Optimization problem, NP-hard, Graph Isomorphism, Decision NP-complete, Modular product of graphs
Brand: OmniScriptum
SKU: 68949005b10f949e547d75d93627461a

1/1

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

Amazon

Prijzen vanaf

95,35

Uitgelicht

	95,35	Naar shop
	95,35	Naar shop
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

Vergelijk aanbieders (2)

Sorteren op:

€ 95,35 Gratis verzending

Beschrijving (0)

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