Stockhub

Kosaraju's algorithm English (Q2655281)

Item Discussion
Revision as of 20:16, 6 December 2022 by imported>MsynBot (‎Changed an Item: add badge Q70893996 to itwiki sitelink; see Wikidata:Sitelinks to redirects for details #msynbotTask10)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
algorithm to find the strongly connected component of a directed graph English
edit
Language Label Description Also known as
British English
No label defined
No description defined

    Statements

    Freebase ID
    /m/0bgp5l
    1 reference
    stated in
    Q15241312 (Deleted Item)
    publication date
    28 October 2013
    instance of
    algorithm
    0 references
    Q30503704 (Deleted Item)
    0 references
    named after
    S. Rao Kosaraju English
    0 references
    produces
    strongly connected component English
    0 references
    facet of
    strongly connected component English
    0 references
    worst-case time complexity English
    uses
    Q727035 (Deleted Item)
    0 references
    uses
    Q264398 (Deleted Item)
    0 references
    Microsoft Academic ID
    117382039
    0 references
    based on
    Q816319 (Deleted Item)
    0 references
     
    Retrieved from ‘https://stockhub.co/index.php?title=Item:Q2655281&oldid=1775130’