WHWafaa M. A. Habib

Wafaa M. A. Habib

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Wafaa M. A. Habib has a total of 3 co-authors. Here are the top co-authors by number of shared publications:

  • Mohamed E. El-Sharkawi

    Information Systems Department, Faculty of Computers and Artificial Intelligence, Cairo University, Cairo, Egypt

    2 shared publications
  • Hoda M. O. Mokhtar

    Information Systems Department, Faculty of Computers and Artificial Intelligence, Cairo University, Cairo, Egypt

    1 shared publication
  • Hoda M. O. Mokhtar

    Information Systems Department, Faculty of Computers and Artificial Intelligence, Cairo University, Cairo, Egypt

    1 shared publication

Latest Publications

  • Open Access

    Discovering top-weighted k-truss communities in large graphs

    by Wafaa M. A. Habib, Hoda M. O. Mokhtar, Mohamed E. El-Sharkawi

    : Community Search is the problem of querying networks in order to discover dense subgraphs-communities-that satisfy given query parameters. Most community search models consider link structure and ignore link weight while answering the required queries. Given the importance of link weight in different networks, this paper considers both link structure and link weight to discover top-r weighted k-truss communities via community search. The top-weighted k-truss communities are those communities with the highest weight and the highest cohesiveness within the network. All recent studies that considered link weight discover top-weighted communities via global search and index-based search techniques. In this paper three different algorithms are proposed to scale-up the existing approaches of weighted community search via local search. The performance evaluation shows that the proposed algorithms significantly outperform the existing state-of-the-art algorithms over different datasets in terms of search time by several orders of magnitude.


  • Open Access

    Weight-Based K-Truss Community Search via Edge Attachment

    by Wafaa M. A. Habib, Hoda M. O. Mokhtar, Mohamed E. El-Sharkawi

    Community search is the task of discovering dense subgraph that satisfy a set of given query parameters. Most community search algorithms consider link structure while ignoring link weight. A recent study proposed the idea of discovering weighted communities which focuses on both link structure and link weight using an online search approach and index-based approach. In this paper two online algorithms are proposed to scale-up the existing online approach efficiency. Performance evaluation of the proposed algorithms against the existing online approach over different datasets shows a great improvement in terms of search and query evaluation time.