A linear-time parameterized algorithm for computing the width of a DAG (Q2672441)

From MaRDI portal
Revision as of 20:52, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A linear-time parameterized algorithm for computing the width of a DAG
scientific article

    Statements

    A linear-time parameterized algorithm for computing the width of a DAG (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 June 2022
    0 references
    directed acyclic graph
    0 references
    maximum antichain
    0 references
    DAG width
    0 references
    posets
    0 references
    parameterized algorithms
    0 references
    reachability queries
    0 references

    Identifiers