An Introduction to Temporal Graphs: An Algorithmic Perspective
From MaRDI portal
Publication:3464477
DOI10.1007/978-3-319-24024-4_18zbMath1331.68154arXiv1503.00278OpenAlexW1881841366MaRDI QIDQ3464477
Publication date: 27 January 2016
Published in: Algorithms, Probability, Networks, and Games (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.00278
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Traveling salesman problems in temporal graphs ⋮ A Glimpse at Paul G. Spirakis ⋮ Toward a Theory of Markov Influence Systems and their Renormalization ⋮ On temporal graph exploration ⋮ Untangling temporal graphs of bounded degree ⋮ Modeling tripartite entanglement in quantum protocols using evolving entangled hypergraphs ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective*
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance oracles for time-dependent networks
- Mediated population protocols
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- The labeled perfect matching in bipartite graphs
- Efficient continuous-time dynamic network flow algorithms
- Dynamic graph models
- On the minimum label spanning tree problem
- Computation in networks of passively mobile finite-state sensors
- Gossips and telephones
- On temporal graph exploration
- Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata
- Distributed computation in dynamic networks
- Traveling Salesman Problems in Temporal Graphs
- Flooding time in edge-Markovian dynamic graphs
- DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
- Naming and Counting in Anonymous Unknown Dynamic Networks
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- Exploration of Periodically Varying Graphs
- On Spreading a Rumor
- A survey of gossiping and broadcasting in communication networks
- Some Matching Problems for Bipartite Graphs
- Spanning trees with many or few colors in edge-colored graphs
- Distributed Computing: A Locality-Sensitive Approach
- The Traveling Salesman Problem with Distances One and Two
- Lower Bounds on Information Dissemination in Dynamic Networks
- On the Treewidth of Dynamic Graphs
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Temporal Network Optimization Subject to Connectivity Constraints
- Paths, Trees, and Flowers
- Communication in dynamic radio networks
- A Randomized Rounding Approach to the Traveling Salesman Problem
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Simple and efficient local codes for distributed stable network construction
- Connectivity and inference problems for temporal networks
- Graph colouring and the probabilistic method
This page was built for publication: An Introduction to Temporal Graphs: An Algorithmic Perspective
