A scalable approach to computing representative lowest common ancestor in directed acyclic graphs (Q391971)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
scientific article

    Statements

    A scalable approach to computing representative lowest common ancestor in directed acyclic graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    lowest common ancestors
    0 references
    directed acyclic graph
    0 references
    0 references
    0 references