Hamamache Kheddouci

Learn More
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)
The importance gained by the process models in modern information systems led to the increasing proliferation of process model repositories. Matching process models and assessing their similarity are critical functionalities required for the management of these collections. In this work<sup>1</sup> we present an efficient graph-based technique for matching(More)
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)
In this paper, we study a new coloring parameter of a graph called the Gap vertexdistinguishing 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)
The ad hoc networks are completely autonomous wireless networks where all the users are mobile. These networks do not work on any infrastructure and the mobiles communicate either directly or via other nodes of the network by establishing routes. These routes are prone to frequent ruptures because of nodes mobility. If the future movement of the mobile can(More)