Main   Resume   Laboratory   Publications   Presentations   Software   Teaching

Software

• CMCL, TLCL and A-BTER: Methods for Scalable Generation of Graphs with Community Structure
  Random generators for creating massive-scale LFR-like graphs for community detection benchmarking and evaluation.
  Public release pending approvals
• PuLP and XtraPuLP: Partitioning using Label Propagation
  Fast and scalable shared and distributed memory graph partitioners designed for multi-objective multi-constraint partitioning of irregular small-world networks.
  GitHub Site: Library and standalone executable
  It has an interface in the Zoltan2 package of Trilinos
• HPCGraph: Graph Computations on High Performance Computing Systems
  A scalable framework for analyzing multi-billion edge graphs in distributed memory.
  GitHub Site
• Multistep: Connectivity Decomposition
  Shared-memory connectivity algorithms for connected, weakly connected, and strongly connected component graph decompositions.
  GitHub Site
• FASCIA: Fast Approximate Subgraph Counting and Enumeration
  A very fast shared-memory implementation of the Alon et al.'s color-coding algorithm for non-induced tree-structured subgraph counting.
  SourceForge Site
• FastPath: Detecting Signaling Pathways in Biological Networks
  A fast and scalable approach for the detection of highly weighted pathways in biological protein-protein interaction networks.
  SourceForge Site