On the expressivity of time-varying graphs

In highly dynamic systems (such as wireless mobile ad hoc networks, robotic swarms, vehicular networks, etc.) connectivity does not necessarily hold at a given time but temporal paths, or journeys, may still exist over time and space, rendering computing possible; some of these systems allow waiting...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 590; pp. 27 - 37
Main Authors:	Casteigts, Arnaud, Flocchini, Paola, Godard, Emmanuel, Santoro, Nicola, Yamashita, Masafumi
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 26.07.2015 Elsevier
Subjects:	Automata Automation Buffering Computer Science Discrete Mathematics Distributed, Parallel, and Cluster Computing Dynamic networks Dynamical systems Dynamics Expressivity of TVGs Graphs Journeys Language Mathematical analysis Mathematical models Strategy Time-varying graphs Expressivity of TVGs Dynamic networks Language Time-varying graphs Automata Buffering
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!