Algorithms for Edge Coloring Bipartite Graphs and Multigraphs (Q3946187)

From MaRDI portal
Revision as of 14:36, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
scientific article

    Statements

    title
    Algorithms for Edge Coloring Bipartite Graphs and Multigraphs (English)
    0 references
    DOI
    10.1137/0211009
    0 references
    author
    Harold N. Gabow
    0 references
    Oded Kariv
    0 references
    publication date
    1982
    0 references
    Mathematics Subject Classification ID
    05C35
    0 references
    05C15
    0 references
    68Q25
    0 references
    zbMATH DE Number
    3763964
    0 references
    zbMATH Keywords
    open shop scheduling
    0 references
    Euler partition
    0 references
    minimum edge colorings
    0 references
    maximum cardinality matching problems
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3946187&oldid=28215232"
    Powered by MediaWiki