• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: Graph isomorphism problem     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:State100024720, within Data Space : dbpedia.org:8891 associated with source document(s)

Type: Thingyago:WikicatComplexityClassesyago:WikicatComputationalProblemsInGraphTheoryyago:WikicatUnsolvedProblemsInComputerScienceyago:Abstraction100002137yago:Act100030358yago:Activity100407535yago:Algorithm105847438yago:Attribute100024264yago:Class107997703yago:Collection107951464yago:Condition113920835yago:Difficulty114408086yago:Event100029378yago:Group100031264yago:Problem114410605yago:Procedure101023820yago:PsychologicalFeature100023100yago:WikicatGraphAlgorithmsyago:YagoPermanentlyLocatedEntitydiseaseyago:Rule105846932yago:State100024720 New Facet based on Instances of this Class

Unsolved problem in computer science: Can the graph isomorphism problem be solved in polynomial time? (more unsolved problems in computer science) The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic. This problem is a special case of the subgraph isomorphism problem, which asks whether a given graph G contains a subgraph that is isomorphic to another given graph H; this problem is known to be NP-complete. It is also known to be a special case of the non-abelian hidden subgroup problem over the symmetric group.