Stockhub

Tarjan's strongly connected components algorithm English (Q1972285)

Item Discussion
Revision as of 14:40, 4 October 2022 by imported>Tétraodon pardalis (‎Changed [fr] description: algorithme sur les graphes déterminant les composantes fortement connexes, (Shortdesc helper))
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
graph theory algorithm English
edit
Language Label Description Also known as
British English
No label defined
No description defined

    Statements

    instance of
    algorithm
    0 references
    Q30503704 (Deleted Item)
    0 references
    named after
    Q92638 (Deleted Item)
    0 references
    Freebase ID
    /m/026xldr
    1 reference
    stated in
    Q15241312 (Deleted Item)
    publication date
    28 October 2013
    worst-case time complexity English
    0 references
    ACM Classification Code (2012) English
    10010917
    0 references
    facet of
    strongly connected component English
    0 references
    Microsoft Academic ID
    122496902
    0 references
     
    Retrieved from ‘https://stockhub.co/index.php?title=Item:Q1972285&oldid=1434346’