On computing the connectivities of graphs and digraphs (Q3330525)

From MaRDI portal
Revision as of 23:56, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On computing the connectivities of graphs and digraphs
scientific article

    Statements

    title
    On computing the connectivities of graphs and digraphs (English)
    0 references
    author
    S. Louis Hakimi
    0 references
    published in
    Networks
    0 references
    publication date
    1984
    0 references
    zbMATH Keywords
    edge-connectivity
    0 references
    graph
    0 references
    digraph
    0 references
    vertex-connectivity
    0 references
    algorithms
    0 references

    Identifiers

    zbMATH DE Number
    3862456
    0 references
    OpenAlex ID
    W2035315311
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3330525&oldid=32486163"
    Powered by MediaWiki