Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Maximum_common_subgraph_isomorphism_problem> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items 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 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.".
- Maximum_common_subgraph_isomorphism_problem wikiPageID "4288963".
- Maximum_common_subgraph_isomorphism_problem wikiPageRevisionID "581433031".
- Maximum_common_subgraph_isomorphism_problem hasPhotoCollection Maximum_common_subgraph_isomorphism_problem.
- 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 type Abstraction100002137.
- Maximum_common_subgraph_isomorphism_problem type Attribute100024264.
- Maximum_common_subgraph_isomorphism_problem type ComputationalProblemsInGraphTheory.
- Maximum_common_subgraph_isomorphism_problem type Condition113920835.
- Maximum_common_subgraph_isomorphism_problem type Difficulty114408086.
- Maximum_common_subgraph_isomorphism_problem type NP-completeProblems.
- Maximum_common_subgraph_isomorphism_problem type Problem114410605.
- Maximum_common_subgraph_isomorphism_problem type State100024720.
- 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 sameAs Maximum_common_subgraph_isomorphism_problem.
- Maximum_common_subgraph_isomorphism_problem wasDerivedFrom Maximum_common_subgraph_isomorphism_problem?oldid=581433031.
- Maximum_common_subgraph_isomorphism_problem isPrimaryTopicOf Maximum_common_subgraph_isomorphism_problem.