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.
Towards a Unified Theory of Time-Varying Data
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
What is a time-varying graph, a time-varying topological space, or, more generally, a mathematical structure that evolves over time? In this work, we lay the foundations for a general theory of temporal data by introducing categories of narratives. These are sheaves on posets of time intervals that encode snapshots of a temporal object along with the relationships between them. This theory satisfies five desiderata distilled from the burgeoning field of time-varying graphs: (D1) it defines both time-varying objects and their morphisms; (D2) it distinguishes between cumulative and persistent interpretations and provides principled methods for transitioning between them; (D3) it systematically lifts static notions to their temporal analogues; (D4) it is object agnostic; (D5) it integrates with theories of dynamical systems. To achieve this, we build upon existing categorical and sheaf-theoretic approaches to temporal graph theory, generalizing them to any category with limits and colimits. We also formalize tacit intuitions that, while present, often remain implicit in temporal graph theory. Beyond synthesizing and reformulating existing ideas in categorical language, we introduce sheaf-theoretic constructions and prove results that, to our knowledge, have not appeared in the temporal data literature - such as the adjunction between persistent and cumulative narratives. More importantly, we integrate these existing and novel elements into a consistent and coherent framework, setting the stage for a unified theory of time-varying data.
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.