Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Induced_subgraph_isomorphism_problem> ?p ?o }
Showing triples 1 to 46 of
46
with 100 triples per page.
- Induced_subgraph_isomorphism_problem 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.".
- Induced_subgraph_isomorphism_problem wikiPageID "6892618".
- Induced_subgraph_isomorphism_problem wikiPageLength "4856".
- Induced_subgraph_isomorphism_problem wikiPageOutDegree "22".
- Induced_subgraph_isomorphism_problem wikiPageRevisionID "625270327".
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Category:Computational_problems_in_graph_theory.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Category:NP-complete_problems.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Clique_(graph_theory).
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Clique_problem.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Computational_complexity_theory.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Decision_problem.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Glossary_of_graph_theory.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Graph_isomorphism.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Graph_theory.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Hypercube_graph.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Independent_set_(graph_theory).
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Induced_subgraph.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Injective_function.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink K-vertex-connected_graph.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Maximum_clique_problem.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Maximum_independent_set_problem.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink NP-complete.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink NP-completeness.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Outerplanar_graph.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Path_(graph_theory).
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Polynomial_time.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Series-parallel_graph.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Snake-in-the-box.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Subgraph_isomorphism_problem.
- Induced_subgraph_isomorphism_problem wikiPageWikiLink Time_complexity.
- Induced_subgraph_isomorphism_problem wikiPageWikiLinkText "Induced subgraph isomorphism problem".
- Induced_subgraph_isomorphism_problem wikiPageWikiLinkText "induced subgraph isomorphism problem".
- Induced_subgraph_isomorphism_problem hasPhotoCollection Induced_subgraph_isomorphism_problem.
- Induced_subgraph_isomorphism_problem wikiPageUsesTemplate Template:Reflist.
- Induced_subgraph_isomorphism_problem subject Category:Computational_problems_in_graph_theory.
- Induced_subgraph_isomorphism_problem subject Category:NP-complete_problems.
- Induced_subgraph_isomorphism_problem hypernym Problem.
- Induced_subgraph_isomorphism_problem type Disease.
- Induced_subgraph_isomorphism_problem type Combinatoric.
- Induced_subgraph_isomorphism_problem 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.".
- Induced_subgraph_isomorphism_problem label "Induced subgraph isomorphism problem".
- Induced_subgraph_isomorphism_problem sameAs m.0gvn0j.
- Induced_subgraph_isomorphism_problem sameAs Q6027240.
- Induced_subgraph_isomorphism_problem sameAs Q6027240.
- Induced_subgraph_isomorphism_problem wasDerivedFrom Induced_subgraph_isomorphism_problem?oldid=625270327.
- Induced_subgraph_isomorphism_problem isPrimaryTopicOf Induced_subgraph_isomorphism_problem.