Minimum degree orderings (Q848936)

From MaRDI portal
Revision as of 08:18, 6 July 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
Minimum degree orderings
scientific article

    Statements

    title
    Minimum degree orderings (English)
    0 references
    author
    Hiroshi Nagamochi
    0 references
    published in
    Algorithmica
    0 references
    publication date
    23 February 2010
    0 references
    zbMATH Keywords
    edge-connectivity
    0 references
    extreme subsets
    0 references
    graph algorithms
    0 references
    maximum adjacency orderings
    0 references
    minimum cuts
    0 references
    minimum degree orderings
    0 references
    submodular functions
    0 references
    posi-modular functions
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68M10
    0 references
    05C85
    0 references
    zbMATH DE Number
    5674318
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q848936&oldid=1122180"
      Powered by MediaWiki