Analysis of approximate algorithms for edge-coloring bipartite graphs (Q673614)

From MaRDI portal
Revision as of 10:26, 27 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Analysis of approximate algorithms for edge-coloring bipartite graphs
scientific article

    Statements

    Analysis of approximate algorithms for edge-coloring bipartite graphs (English)
    0 references
    0 references
    0 references
    28 February 1997
    0 references
    Analysis of algorithms
    0 references
    Edge coloring
    0 references
    Approximation algorithms
    0 references
    Scheduling
    0 references
    Parallel data transfers
    0 references
    Parallel I/O
    0 references
    Parallel processing
    0 references

    Identifiers