Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Mohammed Amin Tahraoui"'
Publikováno v:
Concurrency and Computation: Practice and Experience. 34
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b74d9b5b03a6d726ca4cae2fb3b0355
https://doi.org/10.1002/cpe.7359
https://doi.org/10.1002/cpe.7359
Publikováno v:
Computer Science Review
Computer Science Review, Elsevier, 2018, 28, pp.92-117
Computer Science Review, Elsevier, 2018, 28, pp.92-117
In networks, not all nodes have the same importance, and some are more important than others. The issue of finding the most important nodes in networks has been addressed extensively, particularly for nodes whose importance is related to network conn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c49f08d4aca0d4dd1a7f9276f0ac070
https://hal.archives-ouvertes.fr/hal-01883783
https://hal.archives-ouvertes.fr/hal-01883783
Publikováno v:
Contributions to Discrete Mathematics
Contributions to Discrete Mathematics, University of Calgary, 2015, 338 (5), ⟨10.1016/j.disc.2014.12.015⟩
Contributions to Discrete Mathematics, University of Calgary, 2015, 338 (5), ⟨10.1016/j.disc.2014.12.015⟩
Graph packing generally deals with unlabeled graphs. In Duchene et?al. (2013), the authors introduced a new variant of the graph packing problem, called labeled packing of a graph. In the current paper, we present several results about the labeled pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33e695f8a7a716d169a8b24731bf1089
https://doi.org/10.1016/j.disc.2014.12.015
https://doi.org/10.1016/j.disc.2014.12.015
Autor:
Nassira Chekkai, Mohamed Ait Hamadouche, Amira Bouaziz, Mohammed Amin Tahraoui, Souham Meshoul, Hamamache Kheddouci, Salim Chikhi
Publikováno v:
2017 First International Conference on Embedded & Distributed Systems (EDiS).
Nowadays, Collaborative Filtering (CF) has become a widely used technique in the field of recommender systems. It aims to recommend items that are relevant to the tastes and preferences of the users based on the social relationships between them. One
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d53f94c60394a76c97a648f6029b4b53
https://doi.org/10.1109/edis.2017.8284027
https://doi.org/10.1109/edis.2017.8284027
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2015, ⟨10.1016/j.dam.2015.01.043⟩
Discrete Applied Mathematics, Elsevier, 2015, ⟨10.1016/j.dam.2015.01.043⟩
International audience; An effective way to analyze and apprehend the structural properties of networks is to find their most critical nodes. This makes them easier to control, whether the purpose is to keep or to delete them. Given a graph, Critical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6a824113f74b35a221004d5bd838d54d
https://hal.archives-ouvertes.fr/hal-01283790
https://hal.archives-ouvertes.fr/hal-01283790
Publikováno v:
Discussiones Mathematicae Graph Theory
Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2017, ⟨10.7151/dmgt.1977⟩
Discussiones Mathematicae Graph Theory, Vol 37, Iss 4, Pp 1015-1025 (2017)
Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2017, ⟨10.7151/dmgt.1977⟩
Discussiones Mathematicae Graph Theory, Vol 37, Iss 4, Pp 1015-1025 (2017)
Graph packing generally deals with unlabeled graphs. In [4], the authors have introduced a new variant of the graph packing problem, called the labeled packing of a graph. This problem has recently been studied on trees [M.A. Tahraoui, E. Duchêne an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24f31c7914f7f268d6c2689a0a9886e2
http://arxiv.org/abs/1410.8694
http://arxiv.org/abs/1410.8694
Autor:
Lei Ning, Karen Pinel-Sauvagnat, Mohand Boughanem, Mohammed Amin Tahraoui, Cyril Laitang, Hamamache Kheddouci
Publikováno v:
Computer Science Review
Computer Science Review, Elsevier, 2013, vol. 8, pp. 1-23. ⟨10.1016/j.cosrev.2013.02.001⟩
Computer Science Review, Elsevier, 2013, vol. 8, pp. 1-23. ⟨10.1016/j.cosrev.2013.02.001⟩
International audience; With the increasing number of available XML documents, numerous approaches for retrieval have been proposed in the literature. They usually use the tree representation of documents and queries to process them, whether in an im
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17022e6a2b979520be4c739f99d9d563
https://oatao.univ-toulouse.fr/12411/
https://oatao.univ-toulouse.fr/12411/
Publikováno v:
Discrete Mathematics
Discrete Mathematics, Elsevier, 2012, 20, Volume 312, pp.3011-3025
Discrete Mathematics, Elsevier, 2012, 20, Volume 312, pp.3011-3025
In this paper, we study a new coloring parameter of graphs called the gap vertex-distinguishing edge coloring . It consists in an edge-coloring of a graph G which induces a vertex distinguishing labeling of G such that the label of each vertex is giv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bcda202eb7e5cbc61414139323f74bc7
https://hal.archives-ouvertes.fr/hal-01353069
https://hal.archives-ouvertes.fr/hal-01353069
Autor:
Zhang, Bing1 (AUTHOR) bingzhang@ysu.edu.cn, Zhao, Xuyang1 (AUTHOR) zhaoxuyangysu@163.com, Nie, Jiangtian2 (AUTHOR) jnie001@e.ntu.edu.sg, Tang, Jianhang3 (AUTHOR) jhtang@gzu.edu.cn, Chen, Yuling3 (AUTHOR) ylchen3@gzu.edu.cn, Zhang, Yang4 (AUTHOR) yangzhang@nuaa.edu.cn, Niyato, Dusit5 (AUTHOR) dniyato@ntu.edu.sg
Publikováno v:
ACM Computing Surveys. Aug2024, Vol. 56 Issue 8, p1-39. 39p.
Publikováno v:
Concurrency & Computation: Practice & Experience; Dec2022, Vol. 34 Issue 28, p1-18, 18p