Zobrazeno 1 - 10
of 82
pro vyhledávání: '"Olivier Togni"'
Publikováno v:
Scientific Reports, Vol 13, Iss 1, Pp 1-19 (2023)
Abstract Networks are essential for analyzing complex systems. However, their growing size necessitates backbone extraction techniques aimed at reducing their size while retaining critical features. In practice, selecting, implementing, and evaluatin
Externí odkaz:
https://doaj.org/article/675ba72b412e405197b1033bfe6a1545
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:3 special issue..., Iss Special issues (2024)
Inspired by the split decomposition of graphs and rank-width, we introduce the notion of $r$-splits. We focus on the family of $r$-splits of a graph of order $n$, and we prove that it forms a hypergraph with several properties. We prove that such hyp
Externí odkaz:
https://doaj.org/article/c34320a252c24d9697b5e8d4345e23ca
Publikováno v:
IET Wireless Sensor Systems, Vol 11, Iss 5, Pp 219-232 (2021)
Abstract The way nodes are arranged in a wireless network can significantly influence performance, especially information flow. The construction of disjoint virtual backbone networks (DVBNs) is one of the ways this can be accomplished. In this study,
Externí odkaz:
https://doaj.org/article/2a7ab4004c824e049cabd1583aa00aa3
Publikováno v:
Computers, Vol 7, Iss 4, p 64 (2018)
Providing Internet of Things (IoT) environments with service level guarantee is a challenging task for improving IoT application usage experience. We specify in this paper an IoT architecture enabling an IoT Service Level Agreement (iSLA) achievement
Externí odkaz:
https://doaj.org/article/e7cd41163a78458f8d89beff66e522e3
Autor:
Hamamache Kheddouci, Olivier Togni
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 10 no. 1, Iss Graph and Algorithms (2008)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/9c0efff5fdec420cb6b795a0d72be198
Autor:
Hamamache Kheddouci, Olivier Togni
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 10, Iss 1 (2008)
For a set D⊂ Z n, the distance graph P n (D) has Z n as its vertex set and the edges are between vertices i and j with |i-j|∈D. The circulant graph C n (D) is defined analogously by considering operations modulo n. The minimum feedback vertex set
Externí odkaz:
https://doaj.org/article/9ef95d0db0114c668079f7053b3100c5
Autor:
Olivier Togni
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 9 no. 1, Iss Graph and Algorithms (2007)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/0c3c6ede544a46e593dbd6a8c055fd63
Autor:
Mustapha Kchikech, Olivier Togni
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 8, Iss 1 (2006)
A multicoloring of a weighted graph G is an assignment of sets of colors to the vertices of G so that two adjacent vertices receive two disjoint sets of colors. A multicoloring problem on G is to find a multicoloring of G. In particular, we are inter
Externí odkaz:
https://doaj.org/article/75df95ba2afb48fd87fa40252fb942c3
A graph $G$ is $(a,b)$-choosable if for any color list of size $a$ associated with each vertices, one can choose a subset of $b$ colors such that adjacent vertices are colored with disjoint color sets. This paper shows an equivalence between the $(a,
Externí odkaz:
http://arxiv.org/abs/1006.2958
Publikováno v:
Intelligent Security Management and Control in the IoT. :77-103
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c19dad1284612b87248d32577fc6a43e
https://doi.org/10.1002/9781394156030.ch4
https://doi.org/10.1002/9781394156030.ch4