Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs (Q911763)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
scientific article

    Statements

    Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    perfect graphs
    0 references
    4-coloring algorithm
    0 references
    planar graphs
    0 references
    PRAM
    0 references
    0 references