The \(b\)-branching problem in digraphs (Q2192110)

From MaRDI portal
Revision as of 02:35, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The \(b\)-branching problem in digraphs
scientific article

    Statements

    title
    The \(b\)-branching problem in digraphs (English)
    0 references
    author
    Naonori Kakimura
    0 references
    Naoyuki Kamiyama
    0 references
    Kenjiro Takazawa
    0 references
    publication date
    29 June 2020
    0 references
    zbMATH Keywords
    greedy algorithm
    0 references
    packing
    0 references
    matroid intersection
    0 references
    sparsity matroid
    0 references
    arborescence
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C20
    0 references
    05C85
    0 references
    05B35
    0 references
    52B40
    0 references
    zbMATH DE Number
    7215503
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2192110&oldid=14719331"
    Powered by MediaWiki