Zobrazeno 1 - 10
of 360
pro vyhledávání: '"Casteigts, A."'
A temporal graph is a graph whose edges only appear at certain points in time. Reachability in these graphs is defined in terms of paths that traverse the edges in chronological order (temporal paths). This form of reachability is neither symmetric n
Externí odkaz:
http://arxiv.org/abs/2406.19514
The Freeze-Tag Problem, introduced in Arkin et al. (SODA'02) consists of waking up a swarm of $n$ robots, starting from a single active robot. In the basic geometric version, every robot is given coordinates in the plane. As soon as a robot is awaken
Externí odkaz:
http://arxiv.org/abs/2402.03258
Autor:
Casteigts, Arnaud, Corsini, Timothée
A graph whose edges only appear at certain points in time is called a temporal graph (among other names). These graphs are temporally connected if all ordered pairs of vertices are connected by a path that traverses edges in chronological order (a te
Externí odkaz:
http://arxiv.org/abs/2312.06260
Dynamic networks are a complex subject. Not only do they inherit the complexity of static networks (as a particular case); they are also sensitive to definitional subtleties that are a frequent source of confusion and incomparability of results in th
Externí odkaz:
http://arxiv.org/abs/2208.01720
Autor:
Becker, Ruben, Casteigts, Arnaud, Crescenzi, Pierluigi, Kodric, Bojana, Renken, Malte, Raskin, Michael, Zamaraev, Viktor
A temporal graph is a graph whose edges appear only at certain points in time. Recently, the second and the last three authors proposed a natural temporal analog of the Erd\H{o}s-R\'enyi random graph model. The proposed model is obtained by randomly
Externí odkaz:
http://arxiv.org/abs/2205.14888
Publikováno v:
In Theoretical Computer Science 12 April 2024 991
Temporal graphs represent interactions between entities over the time. These interactions may be direct (a contact between two nodes at some time instant), or indirect, through sequences of contacts called temporal paths (journeys). Deciding whether
Externí odkaz:
http://arxiv.org/abs/2102.04187
This paper revisits two classical distributed problems in anonymous networks, namely spanning tree construction and topology recognition, from the point of view of graph covering theory. For both problems, we characterize necessary and sufficient con
Externí odkaz:
http://arxiv.org/abs/2101.01409
A graph whose edges only appear at certain points in time is called a temporal graph (among other names). Such a graph is temporally connected if each ordered pair of vertices is connected by a path which traverses edges in chronological order (i.e.,
Externí odkaz:
http://arxiv.org/abs/2011.03738
We study a new version of the Euclidean TSP called VectorTSP (VTSP for short) where a mobile entity is allowed to move according to a set of physical constraints inspired from the pen-and-pencil game Racetrack (also known as Vector Racer ). In contra
Externí odkaz:
http://arxiv.org/abs/2006.03666