7 citations · 17 across the 6 of their papers we have counts for
6 papers
A Parallel Algorithm for Generating a Random Graph with a Prescribed Degree Sequence
Hasanuzzaman Bhuiyan, Maleq Khan, Madhav Marathe
Random graphs (or networks) have gained a significant increase of interest due to its popularity in modeling and simulating many complex real-world systems. Degree sequence is one…
Distributed-Memory Parallel Algorithms for Counting and Listing Triangles in Big Graphs
Shaikh Arifuzzaman, Maleq Khan, Madhav Marathe
Big graphs (networks) arising in numerous application areas pose significant challenges for graph analysts as these graphs grow to billions of nodes and edges and are prohibitively…
Forecasting the Flu: Designing Social Network Sensors for Epidemics
Huijuan Shao, K. S. M. Tozammel Hossain, Hao Wu +5
Early detection and modeling of a contagious epidemic can provide important guidance about quelling the contagion, controlling its spread, or the effective design of countermeasure…
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…
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…
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…