Pinned Repositories
triangle_counting
Count the triangles in undirected graph with CUDA
AlgoDS
Implementation of Algorithms and Data Structures, Problems and Solutions
Algorithm_Problems
awesome-community-detection
A curated list of community detection research papers with implementations.
ca-iris
California repository based on MnDOT iris (aka mn-iris)
coding-interview-university
A complete computer science study plan to become a software engineer.
ctci
Cracking the Coding Interview, 5th Edition
Data_Structure_Problems
dynamic-k-reach
Basic and scalable k-hop reachability index update
Enterprise
Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
admycode's Repositories
admycode/spark
Apache Spark - A unified analytics engine for large-scale data processing
admycode/parallel-euler-tour-tree
Code for "Batch-Parallel Euler Tour Trees" paper
admycode/Large-Scale-Graph-Analytics
admycode/parbutterfly
admycode/hornet
Hornet data structure for sparse dynamic graphs and matrices
admycode/awesome-community-detection
A curated list of community detection research papers with implementations.
admycode/GraphletLift
Python code to compare GraphletLift to a few other algorithms.
admycode/simd-x
SIMD-X: Programming and Processing of Graph Algorithms on GPUs [USENIX ATC '19]
admycode/PGD
A Parallel Graphlet Decomposition Library for Large Graphs
admycode/hybrid_BC
Hybrid methods for Parallel Betweenness Centrality on the GPU
admycode/triangle_counting
Count the triangles in undirected graph with CUDA
admycode/MAIC
Multi-Valued Skyline Community Search
admycode/parallel_enum
A tool for parallel and distributed enumeration of cliques and diameter two kplexes.
admycode/GraMi
GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of magnitudes. GraMi supports finding frequent subgraphs as well as frequent patterns, Compared to subgraphs, patterns offer a more powerful version of matching that captures transitive interactions between graph nodes (like friend of a friend) which are very common in modern applications. Also, GraMi supports user-defined structural and semantic constraints over the results, as well as approximate results. For more details, check our paper: Mohammed Elseidy, Ehab Abdelhamid, Spiros Skiadopoulos, and Panos Kalnis. GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph. PVLDB, 7(7):517-528, 2014.
admycode/TopKDensestSubgraph
Batagelj, Vladimir, and Matjaz Zaversnik. "An O (m) algorithm for cores decomposition of networks." arXiv preprint cs/0310049 (2003).
admycode/AlgoDS
Implementation of Algorithms and Data Structures, Problems and Solutions
admycode/leetcode-1
Leetcode solutions
admycode/interviews
Everything you need to know to get the job.
admycode/LeetCode-Sol-Res
Clean, Understandable Solutions and Resources for LeetCode Online Judge Algorithms Problems.
admycode/interview
Interview questions
admycode/coding-interview-university
A complete computer science study plan to become a software engineer.
admycode/ScaleMine
Parallel Frequent Subgraph Mining
admycode/ctci
Cracking the Coding Interview, 5th Edition
admycode/leetcode
admycode/TopCoder
admycode/kcore
admycode/PKT
Shared-memory Graph Truss Decomposition
admycode/ca-iris
California repository based on MnDOT iris (aka mn-iris)
admycode/LCR
Master's thesis project involving label-constrained reachability (LCR)
admycode/ParaCoM
Parallel core maintenance (ParaCoM) is an efficient parallel algorithm that can update the core numbers of vertices in a dynamic graph when multiple edges are inserted or deleted.