Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q6795883> ?p ?o }
Showing triples 1 to 28 of
28
with 100 triples per page.
- Q6795883 subject Q6306334.
- Q6795883 subject Q7132783.
- Q6795883 subject Q7481159.
- Q6795883 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.".
- Q6795883 wikiPageWikiLink Q1137554.
- Q6795883 wikiPageWikiLink Q1196873.
- Q6795883 wikiPageWikiLink Q131476.
- Q6795883 wikiPageWikiLink Q1539893.
- Q6795883 wikiPageWikiLink Q166507.
- Q6795883 wikiPageWikiLink Q189112.
- Q6795883 wikiPageWikiLink Q205084.
- Q6795883 wikiPageWikiLink Q215206.
- Q6795883 wikiPageWikiLink Q2528185.
- Q6795883 wikiPageWikiLink Q3262192.
- Q6795883 wikiPageWikiLink Q3738036.
- Q6795883 wikiPageWikiLink Q6306334.
- Q6795883 wikiPageWikiLink Q6795885.
- Q6795883 wikiPageWikiLink Q6830528.
- Q6795883 wikiPageWikiLink Q6889729.
- Q6795883 wikiPageWikiLink Q6896054.
- Q6795883 wikiPageWikiLink Q7132783.
- Q6795883 wikiPageWikiLink Q7481159.
- Q6795883 wikiPageWikiLink Q910164.
- Q6795883 wikiPageWikiLink Q92801.
- Q6795883 wikiPageWikiLink Q938821.
- Q6795883 wikiPageWikiLink Q984063.
- Q6795883 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.".
- Q6795883 label "Maximum common subgraph isomorphism problem".