Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q6027240> ?p ?o }
Showing triples 1 to 24 of
24
with 100 triples per page.
- Q6027240 subject Q7132783.
- Q6027240 subject Q7481159.
- Q6027240 abstract "In complexity theory and graph theory, induced subgraph isomorphism is an NP-complete decision problem that involves finding a given graph as an induced subgraph of a larger graph.".
- Q6027240 wikiPageWikiLink Q1060343.
- Q6027240 wikiPageWikiLink Q1196873.
- Q6027240 wikiPageWikiLink Q131476.
- Q6027240 wikiPageWikiLink Q1415372.
- Q6027240 wikiPageWikiLink Q15995476.
- Q6027240 wikiPageWikiLink Q182003.
- Q6027240 wikiPageWikiLink Q205084.
- Q6027240 wikiPageWikiLink Q215206.
- Q6027240 wikiPageWikiLink Q2393193.
- Q6027240 wikiPageWikiLink Q2528185.
- Q6027240 wikiPageWikiLink Q303100.
- Q6027240 wikiPageWikiLink Q3115604.
- Q6027240 wikiPageWikiLink Q3115621.
- Q6027240 wikiPageWikiLink Q3262192.
- Q6027240 wikiPageWikiLink Q7132783.
- Q6027240 wikiPageWikiLink Q7454787.
- Q6027240 wikiPageWikiLink Q7481159.
- Q6027240 wikiPageWikiLink Q761631.
- Q6027240 wikiPageWikiLink Q958394.
- Q6027240 comment "In complexity theory and graph theory, induced subgraph isomorphism is an NP-complete decision problem that involves finding a given graph as an induced subgraph of a larger graph.".
- Q6027240 label "Induced subgraph isomorphism problem".