Introduces TIM width generalizing VIM width and gives meta-algorithms that characterize FPT problems including temporal Hamiltonian path and dominating set.
30 Silvio Micali and Vijay V
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Two new approximation algorithms for SW-TVC on always-star temporal graphs achieve 2Δ-1 and Δ-1 ratios in O(T) and O(TmΔ²) time respectively, with exact solutions for small Δ.
citing papers explorer
-
Families of tractable problems with respect to vertex-interval-membership width and its generalisations
Introduces TIM width generalizing VIM width and gives meta-algorithms that characterize FPT problems including temporal Hamiltonian path and dominating set.
-
New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs
Two new approximation algorithms for SW-TVC on always-star temporal graphs achieve 2Δ-1 and Δ-1 ratios in O(T) and O(TmΔ²) time respectively, with exact solutions for small Δ.