5 papers
On the Complexity of Claw-Free Vertex Splitting
Faisal N. Abu-Khzam, Sergio Thoumi
Vertex splitting consists of taking a vertex in a graph and replacing it with two non-adjacent vertices whose combined neighborhoods is the neighborhood of . The split is sa…
Correlation Clustering with Overlap: a Heuristic Graph Editing Approach
Faisal N. Abu-Khzam, Lucas Isenmann, Sergio Thoumi
Correlation clustering seeks a partition of the vertex set of a given graph/network into groups of closely related, or just close enough, vertices so that elements of different gro…
On the Complexity of 2-club Cluster Editing with Vertex Splitting
Faisal N. Abu-Khzam, Tom Davot, Lucas Isenmann +1
Editing a graph to obtain a disjoint union of s-clubs is one of the models for correlation clustering, which seeks a partition of the vertex set of a graph so that elements of each…
Pack and Measure: An Effective Approach for Influence Propagation in Social Networks
Faisal N. Abu-Khzam, Ghinwa Bou Matar, Sergio Thoumi
The Influence Maximization problem under the Independent Cascade model (IC) is considered. The problem asks for a minimal set of vertices to serve as "seed set" from which a maximu…
Concise Fuzzy Planar Embedding of Graphs: a Dimensionality Reduction Approach
Faisal N. Abu-Khzam, Rana H. Mouawi, Amer Hajj Ahmad +1
The enormous amount of data to be represented using large graphs exceeds in some cases the resources of a conventional computer. Edges in particular can take up a considerable amou…