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.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.