Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Schoeters, Jason"'
A temporal graph can be represented by a graph with an edge labelling, such that an edge is present in the network if and only if the edge is assigned the corresponding time label. A journey is a labelled path in a temporal graph such that labels on
Externí odkaz:
http://arxiv.org/abs/2312.07117
Publikováno v:
In Theoretical Computer Science 24 October 2024 1013
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
Let $G=(V,E)$ be an undirected graph on $n$ vertices and $\lambda:E\to 2^{\mathbb{N}}$ a mapping that assigns to every edge a non-empty set of integer labels (times). Such a graph is {\em temporally connected} if a path exists with non-decreasing tim
Externí odkaz:
http://arxiv.org/abs/1810.00104
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Schoeters, Jason
Publikováno v:
Data Structures and Algorithms [cs.DS]. Université de Bordeaux, 2021. English. ⟨NNT : 2021BORD0127⟩
In this thesis, we are interested in research questions that pertain respectively to temporal graphs, to mobility, as well as to the interaction between the two. The problem we consider on temporal graphs is motivated by a 20-year old open question,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4b8d2a4c59a474ac6260fb328b8edfdb
https://theses.hal.science/tel-03236252
https://theses.hal.science/tel-03236252
Publikováno v:
ALGOTEL 2019-21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications
ALGOTEL 2019-21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France
ALGOTEL 2019-21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France
National audience; Nous nous intéressons à une question posée par Kempe, Kleinberg, et Kumar (STOC 2000) : existe-t-il toujours un sous-ensemble d'arêtes peu dense préservant la connexité temporelle dans un graphe dynamique G ? On appelle ces s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::012eef73326ed8d10db7f759ca16a2b2
https://hal.archives-ouvertes.fr/hal-02117940/document
https://hal.archives-ouvertes.fr/hal-02117940/document