• 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: Level ancestor problem     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : dbo:Disease, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)

Type: yago:Object100002684yago:PhysicalEntity100001930yago:WikicatGraphTheoryObjectsdisease New Facet based on Instances of this Class

In graph theory and theoretical computer science, the level ancestor problem is the problem of preprocessing a given rooted tree T into a data structure that can determine the ancestor of a given node at a given distance from the root of the tree.