2 citations · 2 across the 3 of their papers we have counts for
3 papers
Efficient Subgraph Isomorphism Finding in Large Graphs using Eccentricity and Limiting Recursive Calls
Zubair Ali Ansari, Muhammad Abulaish, Irfan Rashid Thoker +1
The subgraph isomorphism finding problem is a well-studied problem in the field of computer science and graph theory, and it aims to enumerate all instances of a query graph in the…
A Comprehensive Empirical Evaluation of Existing Word Embedding Approaches
Obaidullah Zaland, Muhammad Abulaish, Mohd. Fazil
Vector-based word representations help countless Natural Language Processing (NLP) tasks capture the language's semantic and syntactic regularities. In this paper, we present the c…
A Novel Weighted Distance Measure for Multi-Attributed Graph
Muhammad Abulaish, Jahiruddin
Due to exponential growth of complex data, graph structure has become increasingly important to model various entities and their interactions, with many interesting applications in…