Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q2655281> ?p ?o }
Showing triples 1 to 34 of
34
with 100 triples per page.
- Q2655281 subject Q7022818.
- Q2655281 subject Q7216428.
- Q2655281 abstract "In computer science, Kosaraju's algorithm (also known as the Kosaraju–Sharir algorithm) is a linear time algorithm to find the strongly connected components of a directed graph. Aho, Hopcroft and Ullman credit it to an unpublished paper from 1978 by S. Rao Kosaraju. The same algorithm was independently discovered by Micha Sharir and published by him in 1981. It makes use of the fact that the transpose graph (the same graph with the direction of every edge reversed) has exactly the same strongly connected components as the original graph.".
- Q2655281 wikiPageExternalLink node171.html.
- Q2655281 wikiPageExternalLink computing-strongly-connected-c.
- Q2655281 wikiPageWikiLink Q1137726.
- Q2655281 wikiPageWikiLink Q1141518.
- Q2655281 wikiPageWikiLink Q1210082.
- Q2655281 wikiPageWikiLink Q1972285.
- Q2655281 wikiPageWikiLink Q2003238.
- Q2655281 wikiPageWikiLink Q2024396.
- Q2655281 wikiPageWikiLink Q21198.
- Q2655281 wikiPageWikiLink Q2393193.
- Q2655281 wikiPageWikiLink Q242767.
- Q2655281 wikiPageWikiLink Q2524992.
- Q2655281 wikiPageWikiLink Q264398.
- Q2655281 wikiPageWikiLink Q325904.
- Q2655281 wikiPageWikiLink Q3491411.
- Q2655281 wikiPageWikiLink Q4812191.
- Q2655281 wikiPageWikiLink Q578036.
- Q2655281 wikiPageWikiLink Q62874.
- Q2655281 wikiPageWikiLink Q62898.
- Q2655281 wikiPageWikiLink Q6827992.
- Q2655281 wikiPageWikiLink Q7022818.
- Q2655281 wikiPageWikiLink Q7144620.
- Q2655281 wikiPageWikiLink Q7216428.
- Q2655281 wikiPageWikiLink Q727035.
- Q2655281 wikiPageWikiLink Q7387824.
- Q2655281 wikiPageWikiLink Q816319.
- Q2655281 wikiPageWikiLink Q8366.
- Q2655281 wikiPageWikiLink Q92794.
- Q2655281 wikiPageWikiLink Q93028.
- Q2655281 comment "In computer science, Kosaraju's algorithm (also known as the Kosaraju–Sharir algorithm) is a linear time algorithm to find the strongly connected components of a directed graph. Aho, Hopcroft and Ullman credit it to an unpublished paper from 1978 by S. Rao Kosaraju. The same algorithm was independently discovered by Micha Sharir and published by him in 1981.".
- Q2655281 label "Kosaraju's algorithm".