• 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: Comparability graph     Goto   Sponge   NotDistinct   Permalink

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

Type: softwareyago:Abstraction100002137yago:Family108078020yago:Group100031264yago:Organization108008335yago:WikicatGraphFamiliesyago:YagoLegalActoryago:YagoLegalActorGeoyago:YagoPermanentlyLocatedEntityyago:SocialGroup107950920yago:Unit108189659 New Facet based on Instances of this Class

In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable graphs, containment graphs, and divisor graphs.An incomparability graph is an undirected graph that connects pairs of elements that are not comparable to each other in a partial order.