#### Filter Results:

- Full text PDF available (1)

#### Publication Year

2013

2017

- This year (4)
- Last 5 years (13)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- George M. Slota, Sivasankaran Rajamanickam, Kamesh Madduri
- 2014 IEEE 28th International Parallel andâ€¦
- 2014

Finding the strongly connected components (SCCs) of a directed graph is a fundamental graph-theoretic problem. Tarjan's algorithm is an efficient serial algorithm to find SCCs, but relies on theâ€¦ (More)

- George M. Slota, Kamesh Madduri
- 2013 42nd International Conference on Parallelâ€¦
- 2013

We present a new shared-memory parallel algorithm and implementation called FASCIA for the problems of approximate sub graph counting and sub graph enumeration. The problem of sub graph countingâ€¦ (More)

- George M. Slota, Sivasankaran Rajamanickam, Kamesh Madduri
- 2016 IEEE International Parallel and Distributedâ€¦
- 2016

In recent years, a large number of graph processing frameworks have been introduced, with their goal to simplify analysis of real-world graphs on commodity hardware. Additionally, the Graph500â€¦ (More)

- George M. Slota, Kamesh Madduri
- 2014 21st International Conference on Highâ€¦
- 2014

We present two new algorithms for finding the biconnected components of a large undirected sparse graph. The first algorithm is based on identifying articulation points and labeling edges usingâ€¦ (More)

- George M. Slota, Kamesh Madduri
- 2014 IEEE 28th International Parallel andâ€¦
- 2014

Subgraph counting forms the basis of many complex network analysis metrics, including motif and anti-motif finding, relative graph let frequency distance, and graph let degree distributionâ€¦ (More)

- Sindhuja Parimalarangan, George M. Slota, Kamesh Madduri
- 2017 IEEE International Parallel and Distributedâ€¦
- 2017

Triad census is a graph analytic used for comparative network analysis and to characterize local structure in directed networks. For large sparse graphs, an algorithm by Batagelj and Mrvar isâ€¦ (More)

- George M. Slota, Kamesh Madduri, Sivasankaran Rajamanickam
- 2014 IEEE International Conference on Big Dataâ€¦
- 2014

We present PuLP, a parallel and memory-efficient graph partitioning method specifically designed to partition low-diameter networks with skewed degree distributions. Graph partitioning is anâ€¦ (More)

- George M. Slota, Sivasankaran Rajamanickam, Kamesh Madduri
- 2015 IEEE International Parallel and Distributedâ€¦
- 2015

The divergence in the computer architecture landscape has resulted in different architectures being considered mainstream at the same time. For application and algorithm developers, a dilemma arisesâ€¦ (More)

- George M. Slota, Kamesh Madduri, Sivasankaran Rajamanickam
- SIAM J. Scientific Computing
- 2016

- George M. Slota, Kamesh Madduri
- Parallel Computing
- 2015

We present new parallelization and memory-reducing strategies for the graph-theoretic color-coding approximation technique, with applications to biological network analysis. Color-coding is aâ€¦ (More)