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

 
9786132838285: Maximum Common Subgraph Isomorphism Problem: Computational complexity theory, Optimization problem, NP-hard, Graph theory, Isomorphism, Decision problem, NP-complete, Modular product of graphs
Brossura
ISBN 10: 6132838287 ISBN 13: 9786132838285
Casa editrice: Alphascript Publishing, 2010

Sinossi

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In complexity theory, maximum common subgraph- isomorphism (MCS) is an optimization problem that is known to be NP-hard. The associated decision problem, i.e., given G1, G2 and an integer k, deciding whether G1 contains a subgraph of at least k edges isomorphic to a subgraph of G2 is NP-complete. One possible solution for this problem is to build a modular product graph, in which the largest clique represents a solution for the MCS problem. MCS algorithms have a long tradition in cheminformatics and pharmacophore mapping.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Editore
Alphascript Publishing
Data di pubblicazione
2010
Lingua
Inglese
ISBN 10 
6132838287
ISBN 13 
9786132838285
Rilegatura
Copertina flessibile
Numero di pagine
76
Redattore
Miller Frederic P., Vandome Agnes F., McBrewster John
Contatto del produttore
non disponibile
Persona responsabile
non disponibile