On the complexity of the flow coloring problem (Q499367)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of the flow coloring problem
scientific article

    Statements

    On the complexity of the flow coloring problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    round weighting problem
    0 references
    flow coloring
    0 references
    bipartite graphs
    0 references
    NP-hardness
    0 references
    inapproximability
    0 references
    0 references