Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs - MaRDI portal

Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs (Q3060789)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs
scientific article

    Statements

    title
    Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs (English)
    0 references
    author
    Amr Elmasry
    0 references
    publication date
    9 December 2010
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C40
    0 references
    05C85
    0 references
    68T20
    0 references
    zbMATH DE Number
    5825341
    0 references
    OpenAlex ID
    W1491488300
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3060789&oldid=33039617"
    Powered by MediaWiki