Simple DFS on the complement of a graph and on partially complemented digraphs (Q318918)

From MaRDI portal
Revision as of 15:32, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Simple DFS on the complement of a graph and on partially complemented digraphs
scientific article

    Statements

    title
    Simple DFS on the complement of a graph and on partially complemented digraphs (English)
    0 references
    author
    Nathan Lindzey
    0 references
    Ross M. McConnell
    0 references
    Nissa Osheim
    0 references
    Benson L. Joeris
    0 references
    publication date
    6 October 2016
    0 references
    zbMATH Keywords
    depth-first search
    0 references
    graph algorithms
    0 references
    graph traversal
    0 references
    partially complemented digraphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C85
    0 references
    68P05
    0 references
    zbMATH DE Number
    6633197
    0 references
    OpenAlex ID
    W2962745257
    0 references
    arXiv ID
    1311.1859
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q318918&oldid=36276927"
    Powered by MediaWiki