nkahmed / PGDView external linksLinks
A Parallel Graphlet Decomposition Library for Large Graphs
☆88Mar 21, 2019Updated 6 years ago
Alternatives and similar repositories for PGD
Users that are interested in PGD are comparing it to the libraries listed below
Sorting:
- Parallel Maximum Clique Library☆119Aug 20, 2023Updated 2 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆90Nov 14, 2019Updated 6 years ago
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆18Mar 24, 2023Updated 2 years ago
- ☆12Apr 2, 2025Updated 10 months ago
- A novel approach to evaluate community detection algorithms on ground truth☆22Jun 24, 2021Updated 4 years ago
- Temporal Motif Finder☆25Jan 15, 2017Updated 9 years ago
- Parallel solver for graph Laplacians from large social networks.☆11Jan 5, 2022Updated 4 years ago
- An open implementation of the MC family of maximum clique algorithms☆12Aug 4, 2016Updated 9 years ago
- Library for finding maximum cliques on graphs☆17Jan 11, 2022Updated 4 years ago
- Code for the paper "Higher-order motif analysis in hypergraphs"☆33Apr 5, 2022Updated 3 years ago
- The repo lists papers of various areas, including Graph Analytics, Graph Acceleration, Subgraph Matching, Streaming Graph Management, Wor…☆17Oct 18, 2020Updated 5 years ago
- A tool for parallel and distributed enumeration of cliques and diameter two kplexes.☆15Dec 24, 2022Updated 3 years ago
- A Coq library for reasoning (co)inductively on infinite sequences using LTL-like modal operators☆17Jan 7, 2023Updated 3 years ago
- Packed Memory Array☆17May 14, 2014Updated 11 years ago
- Arya: Arbitrary Graph Pattern Mining with Decomposition-based Sampling☆16Sep 27, 2023Updated 2 years ago
- Cross Entropy Low-rank Logits for graph generation.☆18Aug 2, 2024Updated last year
- ☆42Oct 11, 2021Updated 4 years ago
- A Framework for Graph Sampling and Random Walk on GPUs.☆38Feb 3, 2025Updated last year
- A Note On Over-Smoothing for Graph Neural Network☆20Jun 29, 2020Updated 5 years ago
- Code for "Graph Neural Networks can Recover the Hidden Features Solely from the Graph Structure" (ICML 2023)☆24Jun 1, 2023Updated 2 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Jun 11, 2021Updated 4 years ago
- ☆91Oct 23, 2023Updated 2 years ago
- ☆23Mar 31, 2021Updated 4 years ago
- Code for NeurIPS 2022 paper "Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discriminat…☆56Mar 6, 2023Updated 2 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆63Jun 9, 2021Updated 4 years ago
- 👁️🗨️ Scientists often do the same bad stuff. Automate giving deterministic feedback during peer review with determinstic (LLM-free)☆30May 9, 2025Updated 9 months ago
- ☆173Dec 3, 2018Updated 7 years ago
- Algorithms to list k-cliques in real-world graphs☆25Mar 4, 2021Updated 4 years ago
- A scalable Gensim implementation of "Learning Role-based Graph Embeddings" (IJCAI 2018).☆167Nov 6, 2022Updated 3 years ago
- FlashMob is a shared-memory random walk system.☆32Jul 7, 2023Updated 2 years ago
- High-Performance Streaming Graph Analytics on GPUs☆34Jan 28, 2019Updated 7 years ago
- A system to record and predict office occupancy on a day to day basis☆12Feb 18, 2025Updated 11 months ago
- Implementation of the paper "NetGAN: Generating Graphs via Random Walks".☆198Dec 7, 2020Updated 5 years ago
- ☆32Oct 28, 2020Updated 5 years ago
- Stanford Network Analysis Platform (SNAP) is a general purpose network analysis and graph mining library.☆2,256Dec 10, 2023Updated 2 years ago
- Quickly compute all maximal cliques of a graph☆80Oct 23, 2018Updated 7 years ago
- The code for MuddSub's Alfie AUV☆10Nov 23, 2025Updated 2 months ago
- Cochlear implant signal processing☆10Jun 24, 2021Updated 4 years ago
- ETHZ Heterogeneous Accelerated Compute Cluster.☆38Oct 7, 2025Updated 4 months ago