Efficiently testing-interval connectivity in dynamic graphs
A Casteigts, R Klasing, YM Neggaz… - … Conference on Algorithms …, 2015 - Springer
Many types of dynamic networks are made up of durable entities whose links evolve over
time. When considered from a global and discrete standpoint, these networks are often …
time. When considered from a global and discrete standpoint, these networks are often …
Enabling minimal dominating set in highly dynamic distributed systems
S Dubois, MH Kaaouachi, F Petit - Symposium on Self-Stabilizing Systems, 2015 - Springer
We address the problem of computing a Minimal Dominating Set in highly dynamic
distributed systems. We assume weak connectivity, ie, the network may be disconnected at …
distributed systems. We assume weak connectivity, ie, the network may be disconnected at …
Rendezvous Avoidance File Caching for Mobile Social Networks
File caching and replications for mobile social networks (MSNs) play a critical role in
accessible and faster file sharing for mobile cloud, where copies of an original file are …
accessible and faster file sharing for mobile cloud, where copies of an original file are …
Counting causal paths in big times series data on networks
LV Petrovic, I Scholtes - arXiv preprint arXiv:1905.11287, 2019 - arxiv.org
Graph or network representations are an important foundation for data mining and machine
learning tasks in relational data. Many tools of network analysis, like centrality measures …
learning tasks in relational data. Many tools of network analysis, like centrality measures …
A medium-term disruption tolerant SDN for wireless TCP/IP networks
A novel framework, Medium-Term Disruption Tolerant Software Defined Network (MDT-
SDN), is proposed to handle medium-term disruptions of the order 10 seconds to 6 minutes …
SDN), is proposed to handle medium-term disruptions of the order 10 seconds to 6 minutes …
A journey through dynamic networks (with excursions)
A Casteigts - 2018 - hal.science
Résumé The journey recounted in this document spanned a period of about 10 years, from
the end of the PhD (2007) to current (early 2018). The rst ve years correspond to two …
the end of the PhD (2007) to current (early 2018). The rst ve years correspond to two …
Paco: Fast counting of causal paths in temporal network data
LV Petrović, I Scholtes - Companion Proceedings of the Web Conference …, 2021 - dl.acm.org
Graph or network representations are an important foundation for data mining and machine
learning tasks in relational data. Many tools of network analysis, like centrality measures …
learning tasks in relational data. Many tools of network analysis, like centrality measures …
Energy-aware temporal reachability graphs for time-varying mobile opportunistic networks
X Kui, A Samanta, X Zhu, S Zhang… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
With the rapid emergence of applications in Mobile Opportunistic Networks (MONs),
understanding and characterizing their properties becomes extremely important. A …
understanding and characterizing their properties becomes extremely important. A …
Détection de communautés dynamiques dans des réseaux temporels
R Cazabet - 2013 - theses.hal.science
La détection de communautés dans les réseaux est aujourd'hui un domaine ayant donné
lieu à une abondante littérature. Depuis les travaux de Girvan et Newman en 2002, des …
lieu à une abondante littérature. Depuis les travaux de Girvan et Newman en 2002, des …
A dynamic data structure for temporal reachability with unsorted contact insertions
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 …
may be direct (a contact between two nodes at some time instant), or indirect, through …