Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q2528185> ?p ?o }
Showing triples 1 to 46 of
46
with 100 triples per page.
- Q2528185 subject Q7132783.
- Q2528185 subject Q7216428.
- Q2528185 subject Q7481159.
- Q2528185 abstract "In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G and H are given as input, and one must determine whether G contains a subgraph that is isomorphic to H.Subgraph isomorphism is a generalization of both the maximum clique problem and the problem of testing whether a graph contains a Hamiltonian cycle, and is therefore NP-complete. However certain other cases of subgraph isomorphism may be solved in polynomial time.Sometimes the name subgraph matching is also used for the same problem. This name puts emphasis on finding such a subgraph as opposed to the bare decision problem.".
- Q2528185 wikiPageExternalLink Groger_1992_ActaCybernetica.pdf.
- Q2528185 wikiPageWikiLink Q11660.
- Q2528185 wikiPageWikiLink Q1196873.
- Q2528185 wikiPageWikiLink Q128570.
- Q2528185 wikiPageWikiLink Q141488.
- Q2528185 wikiPageWikiLink Q1503724.
- Q2528185 wikiPageWikiLink Q1508564.
- Q2528185 wikiPageWikiLink Q15710060.
- Q2528185 wikiPageWikiLink Q166507.
- Q2528185 wikiPageWikiLink Q1709878.
- Q2528185 wikiPageWikiLink Q1815901.
- Q2528185 wikiPageWikiLink Q18207250.
- Q2528185 wikiPageWikiLink Q184793.
- Q2528185 wikiPageWikiLink Q2103034.
- Q2528185 wikiPageWikiLink Q215206.
- Q2528185 wikiPageWikiLink Q2393193.
- Q2528185 wikiPageWikiLink Q2715623.
- Q2528185 wikiPageWikiLink Q273037.
- Q2528185 wikiPageWikiLink Q2878974.
- Q2528185 wikiPageWikiLink Q303100.
- Q2528185 wikiPageWikiLink Q3262192.
- Q2528185 wikiPageWikiLink Q3738036.
- Q2528185 wikiPageWikiLink Q3784250.
- Q2528185 wikiPageWikiLink Q45715.
- Q2528185 wikiPageWikiLink Q4661558.
- Q2528185 wikiPageWikiLink Q466769.
- Q2528185 wikiPageWikiLink Q5249246.
- Q2528185 wikiPageWikiLink Q547823.
- Q2528185 wikiPageWikiLink Q6027240.
- Q2528185 wikiPageWikiLink Q6795883.
- Q2528185 wikiPageWikiLink Q6795885.
- Q2528185 wikiPageWikiLink Q7132783.
- Q2528185 wikiPageWikiLink Q7216428.
- Q2528185 wikiPageWikiLink Q7481159.
- Q2528185 wikiPageWikiLink Q7544680.
- Q2528185 wikiPageWikiLink Q7661893.
- Q2528185 wikiPageWikiLink Q845739.
- Q2528185 wikiPageWikiLink Q910164.
- Q2528185 wikiPageWikiLink Q938821.
- Q2528185 wikiPageWikiLink Q987652.
- Q2528185 comment "In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G and H are given as input, and one must determine whether G contains a subgraph that is isomorphic to H.Subgraph isomorphism is a generalization of both the maximum clique problem and the problem of testing whether a graph contains a Hamiltonian cycle, and is therefore NP-complete.".
- Q2528185 label "Subgraph isomorphism problem".