Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Maximum_common_subgraph_isomorphism_problem> ?p ?o }
Showing triples 1 to 52 of
52
with 100 triples per page.
- Maximum_common_subgraph_isomorphism_problem abstract "In complexity theory, maximum common subgraph-isomorphism (MCS) is an optimization problem that is known to be NP-hard. The formal description of the problem is as follows:Maximum common subgraph-isomorphism(G1, G2) Input: Two graphs G1 and G2. Question: What is the largest subgraph of G1 isomorphic to a subgraph of G2?The associated decision problem, i.e., given G1, G2 and an integer k, deciding whether G1 contains a subgraph of at least k vertices 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.".
- Maximum_common_subgraph_isomorphism_problem wikiPageID "4288963".
- Maximum_common_subgraph_isomorphism_problem wikiPageLength "1624".
- Maximum_common_subgraph_isomorphism_problem wikiPageOutDegree "22".
- Maximum_common_subgraph_isomorphism_problem wikiPageRevisionID "632016235".
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Category:Cheminformatics.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Category:Computational_problems_in_graph_theory.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Category:NP-complete_problems.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Cheminformatics.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Clique_problem.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Computational_complexity_theory.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Computers_and_Intractability.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Computers_and_Intractability:_A_Guide_to_the_Theory_of_NP-Completeness.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink David_S._Johnson.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Decision_problem.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Glossary_of_graph_theory.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Graph_isomorphism_problem.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Graph_theory.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Isomorphic.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Isomorphism.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Maximum_common_edge_subgraph_problem.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Michael_Garey.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Michael_R._Garey.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Modular_product_of_graphs.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Molecule_mining.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink NP-complete.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink NP-completeness.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink NP-hard.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink NP-hardness.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Optimization_problem.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Pharmacophore.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLink Subgraph_isomorphism_problem.
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLinkText "MCS".
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLinkText "Maximum common subgraph isomorphism problem".
- Maximum_common_subgraph_isomorphism_problem wikiPageWikiLinkText "maximum common subgraph".
- Maximum_common_subgraph_isomorphism_problem hasPhotoCollection Maximum_common_subgraph_isomorphism_problem.
- Maximum_common_subgraph_isomorphism_problem wikiPageUsesTemplate Template:Algorithm-stub.
- Maximum_common_subgraph_isomorphism_problem wikiPageUsesTemplate Template:Cite_book.
- Maximum_common_subgraph_isomorphism_problem subject Category:Cheminformatics.
- Maximum_common_subgraph_isomorphism_problem subject Category:Computational_problems_in_graph_theory.
- Maximum_common_subgraph_isomorphism_problem subject Category:NP-complete_problems.
- Maximum_common_subgraph_isomorphism_problem hypernym Problem.
- Maximum_common_subgraph_isomorphism_problem type Disease.
- Maximum_common_subgraph_isomorphism_problem type Cheminformatic.
- Maximum_common_subgraph_isomorphism_problem type Field.
- Maximum_common_subgraph_isomorphism_problem comment "In complexity theory, maximum common subgraph-isomorphism (MCS) is an optimization problem that is known to be NP-hard. The formal description of the problem is as follows:Maximum common subgraph-isomorphism(G1, G2) Input: Two graphs G1 and G2.".
- Maximum_common_subgraph_isomorphism_problem label "Maximum common subgraph isomorphism problem".
- Maximum_common_subgraph_isomorphism_problem sameAs m.0bv9c5.
- Maximum_common_subgraph_isomorphism_problem sameAs Q6795883.
- Maximum_common_subgraph_isomorphism_problem sameAs Q6795883.
- Maximum_common_subgraph_isomorphism_problem wasDerivedFrom Maximum_common_subgraph_isomorphism_problem?oldid=632016235.
- Maximum_common_subgraph_isomorphism_problem isPrimaryTopicOf Maximum_common_subgraph_isomorphism_problem.