Zobrazeno 1 - 10
of 111
pro vyhledávání: '"Stéphane Pérennes"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 18 no. 3, Iss Distributed Computing and... (2016)
The notion of Shared Risk Link Groups (SRLG) captures survivability issues when a set of links of a network may fail simultaneously. The theory of survivable network design relies on basic combinatorial objects that are rather easy to compute in the
Externí odkaz:
https://doaj.org/article/1ce3f4a6a91444cfa9541f4485aaf64d
Publikováno v:
COMPLEX NETWORKS 2020-9th International Conference on Complex Networks and their Applications
COMPLEX NETWORKS 2020-9th International Conference on Complex Networks and their Applications, Dec 2020, Madrid / Virtual, Spain
Studies in Computational Intelligence ISBN: 9783030653507
COMPLEX NETWORKS (2)
Theoretical Computer Science
Theoretical Computer Science, 2023, 940 (Part A), pp.36-51. ⟨10.1016/j.tcs.2022.10.036⟩
COMPLEX NETWORKS 2020-9th International Conference on Complex Networks and their Applications, Dec 2020, Madrid / Virtual, Spain
Studies in Computational Intelligence ISBN: 9783030653507
COMPLEX NETWORKS (2)
Theoretical Computer Science
Theoretical Computer Science, 2023, 940 (Part A), pp.36-51. ⟨10.1016/j.tcs.2022.10.036⟩
The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (almost) any wanted degree distributio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8cada5292789fd796dedd7d47a4c526
https://doi.org/10.1016/j.tcs.2022.10.036
https://doi.org/10.1016/j.tcs.2022.10.036
Publikováno v:
Algorithmica
Algorithmica, Springer Verlag, 2021, 83 (5), pp.1459-1492
Algorithmica, 2021, 83 (5), pp.1459-1492. ⟨10.1007/s00453-020-00790-8⟩
Algorithmica, Springer Verlag, 2021, 83 (5), pp.1459-1492. ⟨10.1007/s00453-020-00790-8⟩
Algorithmica, Springer Verlag, 2021, 83 (5), pp.1459-1492
Algorithmica, 2021, 83 (5), pp.1459-1492. ⟨10.1007/s00453-020-00790-8⟩
Algorithmica, Springer Verlag, 2021, 83 (5), pp.1459-1492. ⟨10.1007/s00453-020-00790-8⟩
In the eternal domination game played on graphs, an attacker attacks a vertex at each turn and a team of guards must move a guard to the attacked vertex to defend it. The guards may only move to adjacent vertices on their turn. The goal is to determi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13e3507391221f2177aa1500e846dca1
https://doi.org/10.1007/s00453-020-00790-8
https://doi.org/10.1007/s00453-020-00790-8
Publikováno v:
Approximation and Online Algorithms ISBN: 9783030046927
WAOA
16th Workshop on Approximation and Online Algorithms (WAOA 2018)
16th Workshop on Approximation and Online Algorithms (WAOA 2018), Aug 2018, Helsinki, Finland. pp.36-50
Algorithmica
Algorithmica, Springer Verlag, 2020, 82 (10), pp.2867-2901. ⟨10.1007/s00453-020-00707-5⟩
Algorithmica, 2020, 82 (10), pp.2867-2901. ⟨10.1007/s00453-020-00707-5⟩
WAOA
16th Workshop on Approximation and Online Algorithms (WAOA 2018)
16th Workshop on Approximation and Online Algorithms (WAOA 2018), Aug 2018, Helsinki, Finland. pp.36-50
Algorithmica
Algorithmica, Springer Verlag, 2020, 82 (10), pp.2867-2901. ⟨10.1007/s00453-020-00707-5⟩
Algorithmica, 2020, 82 (10), pp.2867-2901. ⟨10.1007/s00453-020-00707-5⟩
International audience; In the localization game, introduced by Seager in 2013, an invisible and immobile target is hidden at some vertex of a graph $G$. At every step, one vertex $v$ of $G$ can be probed which results in the knowledge of the distanc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a61bde13785d97389889bc3554678d7
https://doi.org/10.1007/s00453-020-00707-5
https://doi.org/10.1007/s00453-020-00707-5
Autor:
Thierry Turletti, Issam Tahiri, Ruslan Sadykov, Giuseppe Di Lena, Andrea Tomassilli, François Vanderbeck, Stéphane Pérennes, Frédéric Giroire, Damien Saucez, Chidung Lac
Publikováno v:
Computer Networks
Computer Networks, Elsevier, 2021, 192 (108043), ⟨10.1016/j.comnet.2021.108043⟩
Computer Networks, Elsevier, 2021, 192, ⟨10.1016/j.comnet.2021.108043⟩
Computer Networks, 2021, 192 (108043), ⟨10.1016/j.comnet.2021.108043⟩
Computer Networks, Elsevier, 2021, 192 (108043), ⟨10.1016/j.comnet.2021.108043⟩
Computer Networks, Elsevier, 2021, 192, ⟨10.1016/j.comnet.2021.108043⟩
Computer Networks, 2021, 192 (108043), ⟨10.1016/j.comnet.2021.108043⟩
International audience; More than ever, data networks have demonstrated their central role in the world economy, but also in the well-being of humanity that needs fast and reliable networks. In parallel, with the emergence of Network Function Virtual
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70d42a7b2b39a530180102a64874d756
https://hal.inria.fr/hal-03441630/file/2021-COMPNET-Global_Rerouting.pdf
https://hal.inria.fr/hal-03441630/file/2021-COMPNET-Global_Rerouting.pdf
Publikováno v:
Algorithmica
Algorithmica, Springer Verlag, 2020, 82 (2), pp.212-244. ⟨10.1007/s00453-018-0503-9⟩
Algorithmica, 2020, 82 (2), pp.212-244. ⟨10.1007/s00453-018-0503-9⟩
[Research Report] Inria Sophia Antipolis. 2017
28th International Symposium on Algorithms and Computation (ISAAC 2017)
28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017, Phuket, Thailand. ⟨10.4230/LIPIcs⟩
Algorithmica, Springer Verlag, 2020, 82 (2), pp.212-244. ⟨10.1007/s00453-018-0503-9⟩
Algorithmica, 2020, 82 (2), pp.212-244. ⟨10.1007/s00453-018-0503-9⟩
[Research Report] Inria Sophia Antipolis. 2017
28th International Symposium on Algorithms and Computation (ISAAC 2017)
28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017, Phuket, Thailand. ⟨10.4230/LIPIcs⟩
International audience; In the Spy game played on a graph G, a single spy travels the vertices of G at speed s, while multiple slow guards strive to have, at all times, one of them within distance d of that spy. In order to determine the smallest num
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9bc130fb66c5f5a0a0b3fdde1a37a17d
https://hal.archives-ouvertes.fr/hal-01881473/document
https://hal.archives-ouvertes.fr/hal-01881473/document
Autor:
Nathann Cohen, Nicolas Nisse, Rudini Menezes Sampaio, Nícolas A. Martins, Stéphane Pérennes, Fionn Mc Inerney
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2018, 725, pp.1-15. ⟨10.1016/j.tcs.2017.11.015⟩
Theoretical Computer Science, 2018, 725, pp.1-15. ⟨10.1016/j.tcs.2017.11.015⟩
Theoretical Computer Science, Elsevier, 2018, 725, pp.1-15. ⟨10.1016/j.tcs.2017.11.015⟩
Theoretical Computer Science, 2018, 725, pp.1-15. ⟨10.1016/j.tcs.2017.11.015⟩
International audience; We define and study the following two-player game on a graph G. Let k ∈ N *. A set of k guards is occupying some vertices of G while one spy is standing at some node. At each turn, first the spy may move along at most s edge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a64974811e161b71d5237ac83006e95e
https://doi.org/10.1016/j.tcs.2017.11.015
https://doi.org/10.1016/j.tcs.2017.11.015
Publikováno v:
Information and Computation
Information and Computation, Elsevier, 2017, 252, pp.243-260. ⟨10.1016/j.ic.2016.11.007⟩
Information and Computation, 2017, 252, pp.243-260. ⟨10.1016/j.ic.2016.11.007⟩
Information and Computation, Elsevier, 2017, 252, pp.243-260. ⟨10.1016/j.ic.2016.11.007⟩
Information and Computation, 2017, 252, pp.243-260. ⟨10.1016/j.ic.2016.11.007⟩
International audience; In Graph Searching, a team of searchers aims at capturing an invisible fugitive moving arbitrarily fast in a graph. Equivalently, the searchers try to clear a contaminated network. The problem is to compute the minimum number
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20c302307d544c744f6b3c5e08c7d387
https://doi.org/10.1016/j.ic.2016.11.007
https://doi.org/10.1016/j.ic.2016.11.007
Autor:
Andrea Tomassilli, Chidung Lac, Frédéric Giroire, Ruslan Sadykov, Stéphane Pérennes, Damien Saucez, Issam Tahiri, François Vanderbeck, Thierry Turletti, G. Di Lena
Publikováno v:
CloudNet 2019-8th IEEE International Conference on Cloud Networking
CloudNet 2019-8th IEEE International Conference on Cloud Networking, Nov 2019, Coimbra, Portugal
[Research Report] INRIA Sophia Antipolis-I3S. 2019
CloudNet
CloudNet 2019-8th IEEE International Conference on Cloud Networking, Nov 2019, Coimbra, Portugal
[Research Report] INRIA Sophia Antipolis-I3S. 2019
CloudNet
ISP networks are taking a leap forward thanks to emerging technologies such as Software Defined Networking(SDN) and Network Function Virtualization (NFV). Efficient algorithms considered too hard to be put in practice on legacy networks now have a se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a7ee41198cd587ba5eb7ab588ed94940
https://hal.inria.fr/hal-02292971/file/camera-ready-cloudnet.pdf
https://hal.inria.fr/hal-02292971/file/camera-ready-cloudnet.pdf
Publikováno v:
CIAC 2019-11th International Conference on Algorithms and Complexity
CIAC 2019-11th International Conference on Algorithms and Complexity, May 2019, Rome, Italy. pp.311-322
[Research Report] Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France. 2018
Lecture Notes in Computer Science ISBN: 9783030174019
CIAC
CIAC 2019-11th International Conference on Algorithms and Complexity, May 2019, Rome, Italy. pp.311-322
[Research Report] Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France. 2018
Lecture Notes in Computer Science ISBN: 9783030174019
CIAC
International audience; In the eternal domination game played on graphs, an attacker attacks a vertex at each turn and a team of guards must move a guard to the attacked vertex to defend it. The guards may only move to adjacent vertices on their turn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c91fabd870b482c3da0dfb4c42b8ef6
https://hal.inria.fr/hal-02098169/document
https://hal.inria.fr/hal-02098169/document