Temporal network optimization subject to connectivity constraints
From MaRDI portal
graph labelinghardness of approximationMenger's theoremoptimizationtemporal connectivitytemporal network
Distance in graphs (05C12) Connectivity (05C40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)
Recommendations
- Temporal network optimization subject to connectivity constraints
- The complexity of optimal design of temporally connected graphs
- scientific article; zbMATH DE number 934458
- Time-varying network optimization.
- Optimal Time-Varying Flows on Congested Networks
- Robust resource allocations in temporal networks
- Connectivity and inference problems for temporal networks
- Connectivity and inference problems for temporal networks
- On solving quickest time problems in time-dependent, dynamic networks
- A dual framework for time-variant network decision problems
Cites work
- An introduction to temporal graphs: an algorithmic perspective
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- Complexity classifications of Boolean constraint satisfaction problems
- Computation in networks of passively mobile finite-state sensors
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Connectivity and inference problems for temporal networks
- Dijkstra's algorithm on-line
- Distance labeling in graphs (extended abstract)
- Distributed computation in dynamic networks
- Efficient continuous-time dynamic network flow algorithms
- Fibonacci heaps and their uses in improved network optimization algorithms
- Flooding time in edge-Markovian dynamic graphs
- Graph colouring and the probabilistic method
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 2086372 (Why is no real title available?)
- scientific article; zbMATH DE number 961960 (Why is no real title available?)
- Introduction to algorithms
- Labeling Schemes for Flow and Connectivity
- Mediated population protocols
- On Syntactic versus Computational Views of Approximability
- On the complexity of information spreading in dynamic networks
- Temporal network optimization subject to connectivity constraints
Cited in
(55)- Visiting a network of services with time constraints.
- Finding temporal paths under waiting time constraints
- Temporal vertex cover with a sliding time window
- Sliding window temporal graph coloring
- Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes
- Distributed computation and reconfiguration in actively dynamic networks
- Mengerian temporal graphs revisited
- How fast can we reach a target vertex in stochastic temporal graphs?
- On short fastest paths in temporal graphs
- Edge-disjoint branchings in temporal digraphs
- The complexity of optimal design of temporally connected graphs
- Optimizing reachability sets in temporal graphs by delaying
- On the size and the approximability of minimum temporally connected subgraphs
- Edge-Disjoint Branchings in Temporal Graphs
- On verifying and maintaining connectivity of interval temporal networks
- Deleting edges to restrict the size of an epidemic in temporal networks
- Temporal network optimization subject to connectivity constraints
- Connectivity and inference problems for temporal networks
- Connectivity and inference problems for temporal networks
- Edge exploration of temporal graphs
- Edge exploration of temporal graphs
- On finding separators in temporal split and permutation graphs
- Finding Temporal Paths Under Waiting Time Constraints.
- Shortest Journeys in Directed Temporal Graphs
- Mengerian graphs: characterization and recognition
- Blackout-tolerant temporal spanners
- The complexity of growing a graph
- A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form
- Blackout-tolerant temporal spanners
- Computing maximum matchings in temporal graphs
- Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs
- Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
- Temporal reachability minimization: delaying vs. deleting
- Snapshot disjointness in temporal graphs
- The complexity of computing optimum labelings for temporal connectivity
- The complexity of growing a graph
- Cluster editing for multi-layer and temporal graphs
- On computing optimal temporal branchings and spanning subgraphs
- On the parameterized complexity of computing good edge-labelings
- Disjoint temporal walks under waiting time constraints
- Temporalizing digraphs via linear-size balanced bi-trees
- Temporal graph realization from fastest paths
- Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs
- Parameterized algorithms for multi-label periodic temporal graph realization
- Sparse temporal spanners with low stretch
- Counting temporal paths
- The complexity of transitively orienting temporal graphs
- As time goes by: adding a temporal dimension to resolve delegations in liquid democracy
- Structural parameters for dense temporal graphs
- Temporal graph realization with bounded stretch
- Temporal connectivity: coping with foreseen and unforeseen delays
- Temporal graph realization with bounded stretch
- Reachability in temporal graphs under perturbation
- Recognizing and realizing temporal reachability graphs
- Time-varying network optimization.
This page was built for publication: Temporal network optimization subject to connectivity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1739101)
