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

 
9786132838285: Maximum Common Subgraph Isomorphism Problem: Computational complexity theory, Optimization problem, NP-hard, Graph theory, Isomorphism, Decision problem, NP-complete, Modular product of graphs
Tapa blanda
ISBN 10: 6132838287 ISBN 13: 9786132838285
Editorial: OmniScriptum, 2010

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
OmniScriptum
Año de publicación
2010
Idioma
Inglés
ISBN 10 
6132838287
ISBN 13 
9786132838285
Encuadernación
Tapa blanda
Número de páginas
76
Editor
Miller Frederic P., Vandome Agnes F., McBrewster John
Contacto del fabricante
no disponible
Persona responsable
no disponible