Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q2003238> ?p ?o }
Showing triples 1 to 43 of
43
with 100 triples per page.
- Q2003238 subject Q7007196.
- Q2003238 subject Q7022818.
- Q2003238 abstract "In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly connected components of an arbitrary directed graph form a partition into subgraphs that are themselves strongly connected. It is possible to test the strong connectivity of a graph, or to find its strongly connected components, in linear time.".
- Q2003238 thumbnail Scc.png?width=300.
- Q2003238 wikiPageExternalLink jbpt.
- Q2003238 wikiPageExternalLink tarjan-algorithm-find-strongly-connected-components.
- Q2003238 wikiPageWikiLink Q1065144.
- Q2003238 wikiPageWikiLink Q1137726.
- Q2003238 wikiPageWikiLink Q1195339.
- Q2003238 wikiPageWikiLink Q1211071.
- Q2003238 wikiPageWikiLink Q130901.
- Q2003238 wikiPageWikiLink Q130998.
- Q2003238 wikiPageWikiLink Q1361526.
- Q2003238 wikiPageWikiLink Q1397646.
- Q2003238 wikiPageWikiLink Q1415372.
- Q2003238 wikiPageWikiLink Q1475294.
- Q2003238 wikiPageWikiLink Q17098063.
- Q2003238 wikiPageWikiLink Q174733.
- Q2003238 wikiPageWikiLink Q177929.
- Q2003238 wikiPageWikiLink Q1972285.
- Q2003238 wikiPageWikiLink Q2393193.
- Q2003238 wikiPageWikiLink Q2655281.
- Q2003238 wikiPageWikiLink Q2997928.
- Q2003238 wikiPageWikiLink Q3034655.
- Q2003238 wikiPageWikiLink Q3491411.
- Q2003238 wikiPageWikiLink Q381060.
- Q2003238 wikiPageWikiLink Q4596967.
- Q2003238 wikiPageWikiLink Q5313464.
- Q2003238 wikiPageWikiLink Q5325632.
- Q2003238 wikiPageWikiLink Q6827992.
- Q2003238 wikiPageWikiLink Q6889712.
- Q2003238 wikiPageWikiLink Q7007196.
- Q2003238 wikiPageWikiLink Q7022818.
- Q2003238 wikiPageWikiLink Q7102401.
- Q2003238 wikiPageWikiLink Q7144620.
- Q2003238 wikiPageWikiLink Q7341043.
- Q2003238 wikiPageWikiLink Q7387824.
- Q2003238 wikiPageWikiLink Q816319.
- Q2003238 wikiPageWikiLink Q8556.
- Q2003238 wikiPageWikiLink Q92638.
- Q2003238 comment "In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly connected components of an arbitrary directed graph form a partition into subgraphs that are themselves strongly connected. It is possible to test the strong connectivity of a graph, or to find its strongly connected components, in linear time.".
- Q2003238 label "Strongly connected component".
- Q2003238 depiction Scc.png.
