Search Results - "Chaitanya, Meher"

Work efficient parallel algorithms for large graph exploration on emerging heterogeneous architectures by Banerjee, Dip Sankar, Kumar, Ashutosh, Chaitanya, Meher, Sharma, Shashank, Kothapalli, Kishore

“…Graph algorithms play a prominent role in several fields of sciences and engineering. Notable among them are graph traversal, finding the connected components…”
Get full text

Tight Sampling in Unbounded Networks by Jaglan, Kshitijaa, Chaitanya, Meher, Sharma, Triansh, Singam, Abhijeeth, Goyal, Nidhi, Kumaraguru, Ponnurangam, Brandes, Ulrik

“…The default approach to deal with the enormous size and limited accessibility of many Web and social media networks is to sample one or more subnetworks from a…”
Get full text

A Simple Parallel Algorithm for Biconnected Components in Sparse Graphs by Chaitanya, Meher, Kothapalli, Kishore

“…In this paper we design and implement an algorithm for finding the biconnected components of a given graph. Our algorithm is based on experimental evidence…”
Get full text

Efficient Parallel Ear Decomposition of Graphs with Application to Betweenness-Centrality by Pachorkar, Charudatt, Chaitanya, Meher, Kothapalli, Kishore, Bera, Debajyoti

“…Parallel graph algorithms continue to attract a lot of research attention given their applications to several fields of sciences and engineering. Efficient…”
Get full text

Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems by Dutta, Debarshi, Chaitanya, Meher, Kothapalli, Kishore, Bera, Debajyoti

“…Graph algorithms play an important role in several fields of sciences and engineering. Prominent among them are the All-Pairs-Shortest-Paths (APSP) and related…”
Get full text