1 citations · 1 across the 4 of their papers we have counts for
5 papers
Hypergraphs with Polynomial Representation: Introducing -splits
François Pitois, Mohammed Haddad, Hamida Seba +1
Inspired by the split decomposition of graphs and rank-width, we introduce the notion of -splits. We focus on the family of -splits of a graph of order , and we prove that…
A Neighborhood-preserving Graph Summarization
Abd Errahmane Kiouche, Julien Baste, Mohammed Haddad +1
We introduce in this paper a new summarization method for large graphs. Our summarization approach retains only a user-specified proportion of the neighbors of each node in the gra…
[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…
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…
Resiliency in Distributed Sensor Networks for PHM of the Monitoring Targets
Jacques Bahi, Wiem Elghazel, Christophe Guyeux +4
In condition-based maintenance, real-time observations are crucial for on-line health assessment. When the monitoring system is a wireless sensor network, data loss becomes highly…