Computing Critical Nodes in Directed Graphs (Q4555541)

From MaRDI portal
Revision as of 08:47, 27 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129560144, #quickstatements; #temporary_batch_1724739681498)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6981840
Language Label Description Also known as
English
Computing Critical Nodes in Directed Graphs
scientific article; zbMATH DE number 6981840

    Statements

    title
    Computing Critical Nodes in Directed Graphs (English)
    0 references
    DOI
    10.1145/3228332
    0 references
    author
    Nilakantha Paudel
    0 references
    Loukas Georgiadis
    0 references
    Giuseppe F. Italiano
    0 references
    publication date
    20 November 2018
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C20
    0 references
    05C85
    0 references
    68W40
    0 references
    zbMATH DE Number
    6981840
    0 references
    zbMATH Keywords
    combinatorial optimization
    0 references
    NP-hardness
    0 references
    critical nodes
    0 references
    directed graphs
    0 references
    strong articulation points
    0 references
    strong connectivity
    0 references
    OpenAlex ID
    W2884830210
    0 references
    Wikidata QID
    Q129560144
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4555541&oldid=37635591"
    Powered by MediaWiki