A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A parameterized algorithmics framework for degree sequence completion problems in directed graphs
scientific article

    Statements

    A parameterized algorithmics framework for degree sequence completion problems in directed graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 April 2019
    0 references
    NP-hard graph problem
    0 references
    graph realizability
    0 references
    \(k\)-anonymity
    0 references
    graph modification
    0 references
    arc insertion
    0 references
    fixed-parameter tractability
    0 references
    kernelization
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers