Under the temporal Dilworth promise, minimum temporal (disjoint) path covers equal the Lovász number of the connectivity graph and are poly-time solvable; TPC is W[1]-hard by deletion distance to linear forest but FPT by vertex cover when time-steps are parameterized.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.
citing papers explorer
-
Temporal Path Covers: Dilworth Properties and Parameterized Complexity
Under the temporal Dilworth promise, minimum temporal (disjoint) path covers equal the Lovász number of the connectivity graph and are poly-time solvable; TPC is W[1]-hard by deletion distance to linear forest but FPT by vertex cover when time-steps are parameterized.
-
Maximizing Reachability via Shifting of Temporal Paths
Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.