Using expander graphs to find vertex connectivity (Q3455218)

From MaRDI portal
Revision as of 20:33, 6 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Using expander graphs to find vertex connectivity
scientific article

    Statements

    title
    Using expander graphs to find vertex connectivity (English)
    0 references
    author
    Harold N. Gabow
    0 references
    publication date
    4 December 2015
    0 references
    zbMATH Keywords
    expander graphs
    0 references
    graphs
    0 references
    vertex connectivity
    0 references

    Identifiers

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