Maximum Common Subgraph Isomorphism (3 results)
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 159.15
US$ 26.13 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 76 pp. Englisch.
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 159.15
US$ 68.17 shippingShips from Germany to U.S.A.Quantity: 1 available
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.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 161.06
US$ 68.92 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering.
