About: Weak component

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In graph theory, the weak components of a directed graph partition the vertices of the graph into subsets that are totally ordered by reachability. They form the finest partition of the set of vertices that is totally ordered in this way.

Property Value
dbo:abstract
  • In graph theory, the weak components of a directed graph partition the vertices of the graph into subsets that are totally ordered by reachability. They form the finest partition of the set of vertices that is totally ordered in this way. (en)
dbo:wikiPageID
  • 69801895 (xsd:integer)
dbo:wikiPageLength
  • 11634 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1092124210 (xsd:integer)
dbo:wikiPageWikiLink
dbp:cs1Dates
  • ly (en)
dbp:date
  • January 2022 (en)
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In graph theory, the weak components of a directed graph partition the vertices of the graph into subsets that are totally ordered by reachability. They form the finest partition of the set of vertices that is totally ordered in this way. (en)
rdfs:label
  • Weak component (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License