5 citations · 5 across the 6 of their papers we have counts for
10 papers
Graph analytics workflows enactment on just in time data centres, Position Paper
Ali Akoglu, José-Luis Zechinelli-Martini, Hamamache Kheddouci +1
This paper discusses our vision of multirole-capable decision-making systems across a broad range of Data Science (DS) workflows working on graphs through disaggregated data centre…
[1,2]-Domination in Generalized Petersen Graphs
Fairouz Beggas, Volker Turau, Mohammed Haddad +1
A vertex subset of a graph is a -dominating set if each vertex of is adjacent to either one or two vertices in . The minimum cardinality of…
Eternal dominating sets on digraphs and orientations of graphs
Guillaume Bagan, Alice Joffard, Hamamache Kheddouci
We study the eternal dominating number and the m-eternal dominating number on digraphs. We generalize known results on graphs to digraphs. We also consider the problem "oriented (m…
Labeled Packing of Cycles and Circuits
Alice Joffard, Hamamache Kheddouci
In 2013, Duch{ê}ne, Kheddouci, Nowakowski and Tahraoui [4, 9] introduced a labeled version of the graph packing problem. It led to the introduction of a new parameter for graphs, t…
Complexity of Edge Monitoring on Some Graph Classes
Guillaume Bagan, Fairouz Beggas, Mohammed Haddad +1
In this paper, we study the complexity of the edge monitoring problem. A vertex monitors an edge if both extremities together with form a triangle in the graph. Given a…
Groupoid exactness and the weak containment problem
Claire Anantharaman-Delaroche
Our purpose is to study in the setting of locally compact groupoids the analogues of the well-known equivalent definitions of exactness for discrete groups. Our best results are ob…
Subdivision into i-packings and S-packing chromatic number of some lattices
Nicolas Gastineau, Hamamache Kheddouci, Olivier Togni
An -packing in a graph is a set of vertices at pairwise distance greater than . For a nondecreasing sequence of integers , the -packing chrom…
Labeled embedding of (n,n-2)-graphs in their complements
M. A. Tahraoui, E. Duchene, H. Kheddouci +1
Graph packing generally deals with unlabeled graphs. In \cite{EHRT11}, the authors have introduced a new variant of the graph packing problem, called the \textit{labeled packing of…
On the family of -regular graphs with Grundy number
Nicolas Gastineau, Hamamache Kheddouci, Olivier Togni
The Grundy number of a graph , denoted by , is the largest such that there exists a partition of , into independent sets and every vertex o…
Labeled Packing of Non Star Tree into its Fifth Power and Sixth Power
Amine El Sahili, Hamamache Kheddouci, Maidoun Mortada
In this paper we prove that we can find a labeled packing of a non star tree into with labels, where is the number of vertices of $T…