Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs (Q2946426)

From MaRDI portal
Revision as of 20:16, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs
scientific article

    Statements

    title
    Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs (English)
    0 references
    author
    Xiaowei Wu
    0 references
    Chenzi Zhang
    0 references
    publication date
    16 September 2015
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C20
    0 references
    05C40
    0 references
    05C85
    0 references
    68Q25
    0 references
    68W40
    0 references
    zbMATH DE Number
    6482840
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2946426&oldid=15938895"
    Powered by MediaWiki