Connectivity and inference problems for temporal networks
From MaRDI portal
(Redirected from Publication:5895205)
Recommendations
Cited in
(52)- Temporal network optimization subject to connectivity constraints
- Finding temporal paths under waiting time constraints
- Temporal vertex cover with a sliding time window
- A simple rounding scheme for multistage optimization
- Königsberg sightseeing: Eulerian walks in temporal graphs
- How fast can we reach a target vertex in stochastic temporal graphs?
- Assigning times to minimise reachability in temporal graphs
- Ranking in evolving complex networks
- The complexity of optimal design of temporally connected graphs
- The network-untangling problem: from interactions to activity timelines
- Deleting edges to restrict the size of an epidemic in temporal networks
- Eulerian walks in temporal graphs
- Traveling salesman problems in temporal graphs
- Smart contract-driven mechanism design to mitigate information diffusion in social networks
- A glimpse at Paul G. Spirakis
- An introduction to temporal graphs: an algorithmic perspective
- Efficient routing in carrier-based mobile networks
- Braid groups in complex spaces.
- On packing arborescences in temporal networks
- Convergecast tree on temporal graphs
- Finding proper time intervals for dynamic network extraction
- Temporal vertex cover with a sliding time window
- Network interpolation
- Edge-Disjoint Branchings in Temporal Graphs
- On verifying and maintaining connectivity of interval temporal networks
- How fast can we reach a target vertex in stochastic temporal graphs?
- Temporal cliques admit sparse spanners
- Deleting edges to restrict the size of an epidemic in temporal networks
- An introduction to temporal graphs: an algorithmic perspective
- Connectivity and inference problems for temporal networks
- The temporal explorer who returns to the base
- Approximating multistage matching problems
- Approximating multistage matching problems
- Sharp Thresholds in Random Simple Temporal Graphs
- The Complexity of Transitively Orienting Temporal Graphs
- Payment scheduling in the interval debt model
- On computing large temporal (unilateral) connected components
- Paths and connectivity in temporal graphs. Textbook for a mini course at the 34th Brazilian mathematics colloquium -- 34\degree Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, Brazil, Juli 2023
- EVENT GRAPHS: ADVANCES AND APPLICATIONS OF SECOND-ORDER TIME-UNFOLDED TEMPORAL NETWORK MODELS
- Payment scheduling in the interval debt model
- On the parameterized complexity of computing good edge-labelings
- Finding a minimum source set in temporal graphs
- Temporal reachability dominating sets: contagion in temporal graphs
- Forbidden patterns in temporal graphs resulting from encounters in a corridor
- Resolving sets in temporal graphs
- Distance to transitivity: new parameters for taming reachability in temporal graphs
- Temporal connectivity augmentation
- Multilayer network science: theory, methods, and applications
- Recognizing and realizing temporal reachability graphs
- The shortest temporal exploration problem
- Enumerating spanners in directed temporal graphs
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
This page was built for publication: Connectivity and inference problems for temporal networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895205)
