This account contains the source code of the research projects of the DIPSA group in Queen's University Belfast, UK.
Please visit the following website for the details of the projects.
This account contains the source code of the research projects of the DIPSA group in Queen's University Belfast, UK.
Please visit the following website for the details of the projects.
Forked from Jaiwen/GraphGrind
NUMA-Aware High-Performance Graph Partitioning and Processing (ICPP'17 and VEBO@PPoPP'19)
C++ 1
Forked from junkyulee/dipet_mixed_krls
A mixed-precision Kernel Recursive Least Squares algorithm
C 1
Forked from MohsenKoohi/LaganLighter
LaganLighter: Structure-Aware High-Performance Graph Algorithms
C 1
Forked from MohsenKoohi/ParaGrapher
ParaGrapher: Graph Loading API and Library
C 1
Forked from MohsenKoohi/MS-BioGraphs-Validation
MS-BioGraphs-Validation: Validation Code for MS-BioGraphs
Java 1
OrbitSI is a NetworkX-based Python package that efficiently solves the subgraph isomorphism enumeration problem, i.e., finding all subgraphs in a large data graph Gd that are isomorphic to a pattern/query graph Gp. It also supports fast vertex orbit counting, which summarises the local structural roles of vertices within a network.
LaganLighter: Structure-Aware High-Performance Graph Algorithms
QClique: Optimizing Performance and Accuracy in Maximum Weighted Clique
MS-BioGraphs-Validation: Validation Code for MS-BioGraphs
NUMA-Aware High-Performance Graph Partitioning and Processing (ICPP'17 and VEBO@PPoPP'19)
Loading…
Loading…