Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328)

From MaRDI portal
Revision as of 02:14, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Parallel O(log n) time edge-colouring of trees and Halin graphs
scientific article

    Statements

    Parallel O(log n) time edge-colouring of trees and Halin graphs (English)
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    parallel computation
    0 references
    edge-colouring
    0 references
    trees
    0 references
    PRAM
    0 references
    Halin graphs
    0 references
    Hamiltonian cycle
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references