Maximum Common Subgraph Isomorphism Problem: Computational complexity theory, Optimization problem, NP-hard, Graph theory, Isomorphism, Decision problem, NP-complete, Modular product of graphs - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
Search results for Maximum Common Subgraph Isomorphism Problem: Computational...
Seller Image
Maximum Common Subgraph Isomorphism Problem
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 76 pp. Englisch. Seller Inventory # 9786132838285
Seller Image
Maximum Common Subgraph Isomorphism Problem
Print on DemandSeller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9786132838285
Seller Image
Maximum Common Subgraph Isomorphism Problem : Computational complexity theory, Optimization problem, NP-hard, Graph theory, Isomorphism, Decision problem, NP-complete, Modular product of graphs
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering. Seller Inventory # 9786132838285