3 papers
cs.DS2021
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…
cs.DM2019
[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…
cs.DM2017
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…