The complexity of finding temporal separators under waiting time constraints (Q2059911)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of finding temporal separators under waiting time constraints
scientific article

    Statements

    The complexity of finding temporal separators under waiting time constraints (English)
    0 references
    0 references
    14 December 2021
    0 references
    temporal graphs
    0 references
    computational complexity
    0 references
    \(\Sigma_2^{\mathrm{P}}\)-completeness
    0 references
    parameterized complexity
    0 references
    restless temporal paths
    0 references

    Identifiers