6 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.DC2014
Parallel Algorithms for Counting Triangles in Networks with Large Degrees
Shaikh Arifuzzaman, Maleq Khan, Madhav Marathe
Finding the number of triangles in a network is an important problem in the analysis of complex networks. The number of triangles also has important applications in data mining. Ex…
cs.DC2014
Parallel Algorithms for Generating Random Networks with Given Degree Sequences
Maksudul Alam, Maleq Khan
Random networks are widely used for modeling and analyzing complex processes. Many mathematical models have been proposed to capture diverse real-world networks. One of the most im…
cs.DC2012★ 6 cited
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model
Maleq Khan, V. S. Anil Kumar, Gopal Pandurangan +1
A fundamental problem in wireless networks is the \emph{minimum spanning tree} (MST) problem: given a set of wireless nodes, compute a spanning tree , so that the total cost…