Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Subgraph_isomorphism_problem> ?p ?o }
Showing triples 1 to 89 of
89
with 100 triples per page.
- Subgraph_isomorphism_problem 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.".
- Subgraph_isomorphism_problem wikiPageExternalLink Groger_1992_ActaCybernetica.pdf.
- Subgraph_isomorphism_problem wikiPageID "450062".
- Subgraph_isomorphism_problem wikiPageLength "11065".
- Subgraph_isomorphism_problem wikiPageOutDegree "45".
- Subgraph_isomorphism_problem wikiPageRevisionID "681978235".
- Subgraph_isomorphism_problem wikiPageWikiLink Aanderaa–Karp–Rosenberg_conjecture.
- Subgraph_isomorphism_problem wikiPageWikiLink Artificial_intelligence.
- Subgraph_isomorphism_problem wikiPageWikiLink Bioinformatics.
- Subgraph_isomorphism_problem wikiPageWikiLink Bounded_expansion.
- Subgraph_isomorphism_problem wikiPageWikiLink Category:Computational_problems_in_graph_theory.
- Subgraph_isomorphism_problem wikiPageWikiLink Category:Graph_algorithms.
- Subgraph_isomorphism_problem wikiPageWikiLink Category:NP-complete_problems.
- Subgraph_isomorphism_problem wikiPageWikiLink Cheminformatics.
- Subgraph_isomorphism_problem wikiPageWikiLink Clique_problem.
- Subgraph_isomorphism_problem wikiPageWikiLink Complete_graph.
- Subgraph_isomorphism_problem wikiPageWikiLink Computer-aided_design.
- Subgraph_isomorphism_problem wikiPageWikiLink Computers_and_Intractability.
- Subgraph_isomorphism_problem wikiPageWikiLink Computers_and_Intractability:_A_Guide_to_the_Theory_of_NP-Completeness.
- Subgraph_isomorphism_problem wikiPageWikiLink Decision_problem.
- Subgraph_isomorphism_problem wikiPageWikiLink Decision_tree_model.
- Subgraph_isomorphism_problem wikiPageWikiLink Electronic_circuit.
- Subgraph_isomorphism_problem wikiPageWikiLink Electronic_circuits.
- Subgraph_isomorphism_problem wikiPageWikiLink Exponential_random_graph.
- Subgraph_isomorphism_problem wikiPageWikiLink Frequent_subtree_mining.
- Subgraph_isomorphism_problem wikiPageWikiLink Glossary_of_graph_theory.
- Subgraph_isomorphism_problem wikiPageWikiLink Graph_(mathematics).
- Subgraph_isomorphism_problem wikiPageWikiLink Graph_isomorphism.
- Subgraph_isomorphism_problem wikiPageWikiLink Graph_isomorphism_problem.
- Subgraph_isomorphism_problem wikiPageWikiLink Graph_rewriting.
- Subgraph_isomorphism_problem wikiPageWikiLink Hamiltonian_cycle.
- Subgraph_isomorphism_problem wikiPageWikiLink Hamiltonian_path.
- Subgraph_isomorphism_problem wikiPageWikiLink Hamiltonian_path_problem.
- Subgraph_isomorphism_problem wikiPageWikiLink Induced_subgraph_isomorphism_problem.
- Subgraph_isomorphism_problem wikiPageWikiLink Journal_of_Experimental_Algorithmics.
- Subgraph_isomorphism_problem wikiPageWikiLink Journal_of_Graph_Algorithms_and_Applications.
- Subgraph_isomorphism_problem wikiPageWikiLink Journal_of_the_ACM.
- Subgraph_isomorphism_problem wikiPageWikiLink Linear_time.
- Subgraph_isomorphism_problem wikiPageWikiLink Maximum_common_edge_subgraph_problem.
- Subgraph_isomorphism_problem wikiPageWikiLink Maximum_common_subgraph_isomorphism_problem.
- Subgraph_isomorphism_problem wikiPageWikiLink NP-complete.
- Subgraph_isomorphism_problem wikiPageWikiLink NP-completeness.
- Subgraph_isomorphism_problem wikiPageWikiLink Pattern_matching.
- Subgraph_isomorphism_problem wikiPageWikiLink Planar_graph.
- Subgraph_isomorphism_problem wikiPageWikiLink Planar_graphs.
- Subgraph_isomorphism_problem wikiPageWikiLink Polynomial-time_many-one_reduction.
- Subgraph_isomorphism_problem wikiPageWikiLink Polynomial-time_reduction.
- Subgraph_isomorphism_problem wikiPageWikiLink Query_complexity.
- Subgraph_isomorphism_problem wikiPageWikiLink Query_language.
- Subgraph_isomorphism_problem wikiPageWikiLink SMILES.
- Subgraph_isomorphism_problem wikiPageWikiLink Simplified_molecular-input_line-entry_system.
- Subgraph_isomorphism_problem wikiPageWikiLink Smiles_arbitrary_target_specification.
- Subgraph_isomorphism_problem wikiPageWikiLink Social_network.
- Subgraph_isomorphism_problem wikiPageWikiLink Structure_mining.
- Subgraph_isomorphism_problem wikiPageWikiLink Symposium_on_Theory_of_Computing.
- Subgraph_isomorphism_problem wikiPageWikiLink Theoretical_computer_science.
- Subgraph_isomorphism_problem wikiPageWikiLink Time_complexity.
- Subgraph_isomorphism_problem wikiPageWikiLink Undirected_graph.
- Subgraph_isomorphism_problem wikiPageWikiLinkText "Subgraph isomorphism problem".
- Subgraph_isomorphism_problem wikiPageWikiLinkText "Subtree isomorphism".
- Subgraph_isomorphism_problem wikiPageWikiLinkText "molecular subgraph searches".
- Subgraph_isomorphism_problem wikiPageWikiLinkText "pattern matching in graphs".
- Subgraph_isomorphism_problem wikiPageWikiLinkText "subgraph isomormism".
- Subgraph_isomorphism_problem wikiPageWikiLinkText "subgraph isomorphism problem".
- Subgraph_isomorphism_problem hasPhotoCollection Subgraph_isomorphism_problem.
- Subgraph_isomorphism_problem wikiPageUsesTemplate Template:Citation.
- Subgraph_isomorphism_problem wikiPageUsesTemplate Template:Harvtxt.
- Subgraph_isomorphism_problem wikiPageUsesTemplate Template:Reflist.
- Subgraph_isomorphism_problem subject Category:Computational_problems_in_graph_theory.
- Subgraph_isomorphism_problem subject Category:Graph_algorithms.
- Subgraph_isomorphism_problem subject Category:NP-complete_problems.
- Subgraph_isomorphism_problem hypernym Task.
- Subgraph_isomorphism_problem type Agent.
- Subgraph_isomorphism_problem type Article.
- Subgraph_isomorphism_problem type Algorithm.
- Subgraph_isomorphism_problem type Article.
- Subgraph_isomorphism_problem 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.".
- Subgraph_isomorphism_problem label "Subgraph isomorphism problem".
- Subgraph_isomorphism_problem sameAs Problema_de_isomorfismo_de_subgrafos.
- Subgraph_isomorphism_problem sameAs Isomorfismo_di_sottografi.
- Subgraph_isomorphism_problem sameAs Problem_izomorfizmu_podgrafu.
- Subgraph_isomorphism_problem sameAs Problema_do_isomorfismo_de_subgrafos.
- Subgraph_isomorphism_problem sameAs m.029xb6.
- Subgraph_isomorphism_problem sameAs Проблем_изоморфизма_графа.
- Subgraph_isomorphism_problem sameAs Bài_toán_đồ_thị_con_đẳng_cấu.
- Subgraph_isomorphism_problem sameAs Q2528185.
- Subgraph_isomorphism_problem sameAs Q2528185.
- Subgraph_isomorphism_problem wasDerivedFrom Subgraph_isomorphism_problem?oldid=681978235.
- Subgraph_isomorphism_problem isPrimaryTopicOf Subgraph_isomorphism_problem.