#### Filter Results:

- Full text PDF available (33)

#### Publication Year

2000

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Yacine Belhoul, Mohammed Haddad, Éric Duchêne, Hamamache Kheddouci
- 2012 IEEE Ninth International Conference on…
- 2012

Retrieving matchings between process models becomes a significant challenge in many applications. Recent attempts have been done to measure similarity of process models based on graph-edit distance. This problem is known to be difficult and computational complexity of exact algorithms for graph matching is exponential. Thus, heuristics must be proposed to… (More)

- Lyes Dekar, Hamamache Kheddouci
- Ad Hoc Networks
- 2008

- Lyes Dekar, Hamamache Kheddouci
- 2009 International Conference on Advanced…
- 2009

A critical challenge in designing ad hoc networks is resource discovery. In this paper, we propose a resource discovery scheme for large scale ad hoc networks, which uses a hypercubes-based backbone. Hypercubes are constructed in the different localities of the network by considering closely its physical topology constraints and the hypercube multi-paths… (More)

- Mohammed Amin Tahraoui, Éric Duchêne, Hamamache Kheddouci
- Discrete Mathematics
- 2012

In this paper, we study a new coloring parameter of a graph called the Gap vertex-distinguishing edge coloring. It is a proper edge-coloring of a graph G which induces a vertex distinguishing labeling of G such that the label of each vertex is given by the difference between the highest and the lowest colors of its adjacent edges. The minimum number of… (More)

Let G be a graph on vertices v 1 , v 2 ,. .. , v n. The b-chromatic number of G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1 ≤ i ≤ k, has at least one representant x i adjacent to a vertex of every color j, 1 ≤ j = i ≤ k. In this paper, we give the… (More)

- Nabil Guellati, Hamamache Kheddouci
- J. Parallel Distrib. Comput.
- 2010

- Brice Effantin, Hamamache Kheddouci
- Discrete Mathematics & Theoretical Computer…
- 2003

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion… (More)

- Kaouther Drira, Hamida Seba, Hamamache Kheddouci
- Computer Communications
- 2010

- Brice Effantin, Hamamache Kheddouci
- ISPA
- 2006

A b-coloring of a graph is a proper coloring where each color admits at least one node (called dominating node) adjacent to every other used color. Such a coloring gives a partitioning of the graph in clusters for which every cluster has a clusterhead (the dominating node) adjacent to each other cluster. Such a decomposition is very interesting for large… (More)