No article text was recorded for this version.
temporal graph complexity
Version 1 of 1130 papers344 conceptsfrozen 2026-10-04
Papers in this version
- Blog: In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?
- Blog: Temporal Dominating Set and Temporal Vertex Cover Under the Lense of Degree Restrictions
- Blog: Interference-free Walks in Time: Temporally Disjoint Paths
- Blog: Temporal Graph Realization from Fastest Paths
- Blog: Temporal vertex cover with a sliding time window
- Blog: Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
- Blog: Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge Periodic Temporal Graphs
- Blog: Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
- Blog: Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk)
- Blog: Disentangling the Computational Complexity of Network Untangling
- Blog: Temporal Graph Realization With Bounded Stretch
- Blog: Algorithms and Complexity for Path Covers of Temporal DAGs
- Blog: The Complexity of Transitively Orienting Temporal Graphs
- Blog: Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
- Blog: Brief Announcement: On the Existence of δ-Temporal Cliques in Random Simple Temporal Graphs
- Blog: Maintaining Bipartite Colourings on Temporal Graphs on a Budget
- Blog: On the Size and the Approximability of Minimum Temporally Connected Subgraphs
- Blog: In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?
- Blog: The temporal explorer who returns to the base
- Blog: The Complexity of Temporal Vertex Cover in Small-Degree Graphs
- Blog: Disentangling the Computational Complexity of Network Untangling
- Blog: On the existence of δ-temporal cliques in random simple temporal graphs
- Blog: Designing and Testing Temporally Connected Graphs
- Blog: Optimizing Reachability Sets in Temporal Graphs by Delaying
- Blog: The temporal explorer who returns to the base
- Blog: The complexity of optimal design of temporally connected graphs
- Blog: Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs
- Blog: Faster Exploration of Some Temporal Graphs
- Blog: Components in time-varying graphs
- Blog: The Complexity of Optimal Design of Temporally Connected Graphs
- Blog: DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
- Blog: Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
- Blog: Temporal Vertex Cover with a Sliding Time Window
- Blog: Offline Directed Steiner Network Problems on Dynamic Graphs
- Blog: Realizing temporal graphs from fastest travel times
- Blog: On the existence of δ-temporal cliques in random simple temporal graphs
- Blog: Flows in Temporal networks
- Blog: Approximating Optimal Labelings for Temporal Connectivity
- Blog: On Temporally Connected Graphs of small cost
- Blog: How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs
- Blog: Cluster Editing in Multi-Layer and Temporal Graphs
- Blog: On Finding Dense Common Subgraphs
- Blog: The complexity of computing optimum labelings for temporal connectivity
- Blog: How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs
- Blog: Efficient Index for Temporal Core Queries over Bipartite Graphs
- Blog: Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs
- Blog: Recognizing and Realizing Temporal Reachability Graphs
- Blog: Realizing temporal transportation trees
- Blog: Sliding Window Temporal Graph Coloring
- Blog: Enumerating Maximal Cliques in Temporal Graphs
- Blog: Minimizing Reachability Times on Temporal Graphs via Shifting Labels
- Blog: The Complexity of Routing with Few Collisions
- Blog: Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source
- Blog: Algorithmic Aspects of Temporal Betweenness
- Blog: Minimizing Reachability Times on Temporal Graphs via Shifting Labels
- Blog: Temporal Network Optimization Subject to Connectivity Constraints
- Blog: Constrained Shortest Path Query in a Large Time-Dependent Graph
- Blog: An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup>
- Blog: Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve over Time
- Blog: Canadian Traveller Problems in Temporal Graphs
Showing 60 of 130 papers.
History & citation
Current · Permanent link
- Computational Complexity of Time Varying Networks merged into this direction (83% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_temporal_graph_complexity_e9cd1c0a,
title = {temporal graph complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/temporal-graph-complexity/rdr_e9cd1c0ac32a4be89996bc3914aa9f3a},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_temporal_graph_complexity_e9cd1c0a_v1,
title = {temporal graph complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/temporal-graph-complexity/rdr_e9cd1c0ac32a4be89996bc3914aa9f3a/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}