Matches in SemOpenAlex for { <https://semopenalex.org/work/W1526067008> ?p ?o ?g. }
Showing items 1 to 47 of
47
with 100 items per page.
- W1526067008 abstract "We address the problem of testing whether a dynamic graph is temporally connected, i.e. a temporal path ({em journey}) exists between all pairs of vertices. We consider a discrete version of the problem, where the topology is given as an evolving graph $G={G_1,G_2,...,G_{k}}$ in which only the set of (directed) edges varies. Two cases are studied, depending on whether a single edge or an unlimited number of edges can be crossed in a same $G_i$ (strict journeys {it vs} non-strict journeys). For strict journeys, two existing algorithms designed for other problems can be adapted. However, we show that a dedicated approach achieves a better time complexity than one of these two algorithms in all cases, and than the other one for those graphs whose density is low at any time (though arbitrary over time). The time complexity of our algorithm is $O(kmu n)$, where $k=|G|$ is the number of time steps and $mu=max(|E_i|)$ is the maximum {em instant} density, to be contrasted with $m=|cup E_i|$, the {em cumulated} density. Indeed, it is not uncommon for a mobility scenario to satisfy, for instance, both $mu=o(n)$ and $m=Theta(n^2)$. We characterize the key values of $k, mu$ and $m$ for which our algorithm should be used. For non-strict journeys, for which no algorithm is known, we show that a similar strategy can be used to answer the question, still in $O(kmu n)$ time." @default.
- W1526067008 created "2016-06-24" @default.
- W1526067008 creator A5011316276 @default.
- W1526067008 creator A5022092651 @default.
- W1526067008 creator A5061267200 @default.
- W1526067008 creator A5061412455 @default.
- W1526067008 creator A5066882204 @default.
- W1526067008 date "2014-06-03" @default.
- W1526067008 modified "2023-09-25" @default.
- W1526067008 title "Un algorithme de test pour la connexité temporelle des graphes dynamiques de faible densité" @default.
- W1526067008 cites W1518080829 @default.
- W1526067008 cites W1560628231 @default.
- W1526067008 cites W1746637951 @default.
- W1526067008 cites W1843380006 @default.
- W1526067008 cites W1984196269 @default.
- W1526067008 cites W1990920784 @default.
- W1526067008 hasPublicationYear "2014" @default.
- W1526067008 type Work @default.
- W1526067008 sameAs 1526067008 @default.
- W1526067008 citedByCount "0" @default.
- W1526067008 crossrefType "proceedings-article" @default.
- W1526067008 hasAuthorship W1526067008A5011316276 @default.
- W1526067008 hasAuthorship W1526067008A5022092651 @default.
- W1526067008 hasAuthorship W1526067008A5061267200 @default.
- W1526067008 hasAuthorship W1526067008A5061412455 @default.
- W1526067008 hasAuthorship W1526067008A5066882204 @default.
- W1526067008 hasBestOaLocation W15260670081 @default.
- W1526067008 hasConcept C41008148 @default.
- W1526067008 hasConceptScore W1526067008C41008148 @default.
- W1526067008 hasLocation W15260670081 @default.
- W1526067008 hasLocation W15260670082 @default.
- W1526067008 hasOpenAccess W1526067008 @default.
- W1526067008 hasPrimaryLocation W15260670081 @default.
- W1526067008 hasRelatedWork W2130043461 @default.
- W1526067008 hasRelatedWork W2350741829 @default.
- W1526067008 hasRelatedWork W2358668433 @default.
- W1526067008 hasRelatedWork W2376932109 @default.
- W1526067008 hasRelatedWork W2382290278 @default.
- W1526067008 hasRelatedWork W2390279801 @default.
- W1526067008 hasRelatedWork W2748952813 @default.
- W1526067008 hasRelatedWork W2899084033 @default.
- W1526067008 hasRelatedWork W3004735627 @default.
- W1526067008 hasRelatedWork W2530322880 @default.
- W1526067008 isParatext "false" @default.
- W1526067008 isRetracted "false" @default.
- W1526067008 magId "1526067008" @default.
- W1526067008 workType "article" @default.