Isbn: 9786132838285 - maximum common subgraph isomorphism problem: computational complexity theory, optimization problem, np-hard, graph theory, isomorphism, decision problem, np-complete, modular product of graphs (3 risultati)

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 76 pp. Englisch.

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In complexitytheory, maximum common subgraph- isomorphism (MCS) is an optimizationproblem that is known to be NP-hard. The associated decision problemi.e., given G1, G2 and an integer k, deciding whether G1 contains asubgraph of at least k edges isomorphic to a subgraph of G2 isNP-complete. One possible solution for this problem is to build amodular product graph, in which the largest clique represents a solutionfor the MCS problem. MCS algorithms have a long tradition incheminformatics and pharmacophore mapping.…

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In complexitytheory, maximum common subgraph- isomorphism (MCS) is an optimizationproblem that is known to be NP-hard. The associated decision problemi.e., given G1, G2 and an integer k, deciding whether G1 contains asubgraph of at least k edges isomorphic to a subgraph of G2 isNP-complete. One possible solution for this problem is to build amodular product graph, in which the largest clique represents a solutionfor the MCS problem. MCS algorithms have a long tradition incheminformatics and pharmacophore mapping.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 76 pp. Englisch.…