Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Subgraph_isomorphism_problem> ?p ?o. }
Showing items 1 to 41 of
41
with 100 items 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 wikiPageRevisionID "580548414".
- Subgraph_isomorphism_problem hasPhotoCollection Subgraph_isomorphism_problem.
- 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 type Abstraction100002137.
- Subgraph_isomorphism_problem type Act100030358.
- Subgraph_isomorphism_problem type Activity100407535.
- Subgraph_isomorphism_problem type Algorithm105847438.
- Subgraph_isomorphism_problem type Attribute100024264.
- Subgraph_isomorphism_problem type ComputationalProblemsInGraphTheory.
- Subgraph_isomorphism_problem type Condition113920835.
- Subgraph_isomorphism_problem type Difficulty114408086.
- Subgraph_isomorphism_problem type Event100029378.
- Subgraph_isomorphism_problem type GraphAlgorithms.
- Subgraph_isomorphism_problem type NP-completeProblems.
- Subgraph_isomorphism_problem type Problem114410605.
- Subgraph_isomorphism_problem type Procedure101023820.
- Subgraph_isomorphism_problem type PsychologicalFeature100023100.
- Subgraph_isomorphism_problem type Rule105846932.
- Subgraph_isomorphism_problem type State100024720.
- Subgraph_isomorphism_problem type YagoPermanentlyLocatedEntity.
- 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 "Isomorfismo di sottografi".
- Subgraph_isomorphism_problem label "Problem izomorfizmu podgrafu".
- Subgraph_isomorphism_problem label "Problema de isomorfismo de subgrafos".
- Subgraph_isomorphism_problem label "Problema do isomorfismo de subgrafos".
- 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 Q2528185.
- Subgraph_isomorphism_problem sameAs Q2528185.
- Subgraph_isomorphism_problem sameAs Subgraph_isomorphism_problem.
- Subgraph_isomorphism_problem wasDerivedFrom Subgraph_isomorphism_problem?oldid=580548414.
- Subgraph_isomorphism_problem isPrimaryTopicOf Subgraph_isomorphism_problem.