Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Mustapha Kchikech"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 2, p 489 (2024)
Externí odkaz:
https://doaj.org/article/89f81f290c3a48f9b7f0af245bdaea97
Publikováno v:
Symmetry, Vol 15, Iss 12, p 2160 (2023)
Given n≥6, D={1,2,…,⌊n2⌋}, and a generating set S⊆D, the circulant graph Cn(S) has Zn as a vertex set in which two distinct vertices i and j are adjacent if and only if |i−j|n∈S, where |x|n=min(|x|,n−|x|) is the circular distance modu
Externí odkaz:
https://doaj.org/article/31787e2a7bcd442eac9cb211d5b4c266
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
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 3, Pp 725-747 (2021)
For a positive integer k ⩾ 1, a graph G with vertex set V is said to be k-packing colorable if there exists a mapping f : V ↦ {1, 2, . . ., k} such that any two distinct vertices x and y with the same color f(x) = f(y) are at distance at least f(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c50d6fe29e21c32415d14a34e483ba7
https://doaj.org/article/72e88e79ee2e42b88f4dc34b844804f9
https://doaj.org/article/72e88e79ee2e42b88f4dc34b844804f9
Publikováno v:
Discussiones Mathematicae Graph Theory.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ae8ed482406055a52e974472f604e5c
https://doi.org/10.7151/dmgt.2457
https://doi.org/10.7151/dmgt.2457
Publikováno v:
Discussiones Mathematicae Graph Theory
Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2008, 28 (1), p. 165-178
Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2008, 28 (1), p. 165-178
International audience; Frequency planning consists in allocating frequencies to the transmitters of a cellular network so as to ensure that no pair of transmitters interfere. We study the problem of reducing interference by modeling this by a radio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0193e33ee434f6be8ea83695c58e9df
https://hal-univ-bourgogne.archives-ouvertes.fr/hal-00655720
https://hal-univ-bourgogne.archives-ouvertes.fr/hal-00655720
Publikováno v:
Discussiones Mathematicae Graph Theory
Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2007, 27 (1), p. 105-123
Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2007, 27 (1), p. 105-123
International audience; Motivated by problems in radio channel assignments, we consider radio k-labelings of graphs. For a connected graph G and an integer k ≥ 1, a linear radio k-labeling of G is an assignment f of nonnegative integers to the vert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::758fe1f83d8a1db223ce588f68cd8605
https://u-bourgogne.hal.science/hal-00655729
https://u-bourgogne.hal.science/hal-00655729
Autor:
Olivier Togni, Mustapha Kchikech
Publikováno v:
Experimental and Efficient Algorithms ISBN: 9783540259206
WEA
WEA
The static frequency assignment problem on cellular networks can be abstracted as a multicoloring problem on a weighted graph, where each vertex of the graph is a base station in the network, and the weight associated with each vertex represents the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee51f4c5b046048046bfa1206142d55b
https://doi.org/10.1007/11427186_16
https://doi.org/10.1007/11427186_16
Autor:
Olivier Togni, Mustapha Kchikech
Publikováno v:
Discrete Mathematics and Theoretical Computer Science ISBN: 9783540405054
DMTCS
DMTCS
In this paper, we will consider the problem of coloring directed paths on a mesh network. A natural application of this graph problem is WDM-routing in all-optical networks. Our main result is a simple 4-approximation algorithm for coloring line-colu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da02c117930fafbcf2ee51cc000d0db5
https://doi.org/10.1007/3-540-45066-1_15
https://doi.org/10.1007/3-540-45066-1_15