On the expressivity of time-varying graphs
From MaRDI portal
Publication:2348032
DOI10.1016/j.tcs.2015.04.004zbMath1327.68174OpenAlexW2156537685MaRDI QIDQ2348032
Paola Flocchini, Masafumi Yamashita, Arnaud Casteigts, Nicola Santoro, Emmanuel Godard
Publication date: 10 June 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.04.004
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Related Items (5)
How fast can we reach a target vertex in stochastic temporal graphs? ⋮ Finding temporal paths under waiting time constraints ⋮ Finding Temporal Paths Under Waiting Time Constraints. ⋮ A topological perspective on distributed network algorithms ⋮ How fast can we reach a target vertex in stochastic temporal graphs
Cites Work
- Unnamed Item
- Efficient routing in carrier-based mobile networks
- Searching for black holes in subways
- On regularity of context-free languages
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- On quasi orders of words and the confluence property
- A theory of timed automata
- Dynamic graph models
- On the exploration of time-varying networks
- A Characterization of Dynamic Networks Where Consensus Is Solvable
- Distributed computation in dynamic networks
- Coordinated consensus in dynamic networks
- DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
- Flooding Time of Edge-Markovian Evolving Graphs
- Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
- Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- Parsimonious flooding in dynamic graphs
- Measuring Temporal Lags in Delay-Tolerant Networks
- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- On the Complexity of Information Spreading in Dynamic Networks
- Ordering by Divisibility in Abstract Algebras
This page was built for publication: On the expressivity of time-varying graphs
