A Parallel Graphlet Decomposition Library for Large Graphs
☆88Mar 21, 2019Updated 7 years ago
Alternatives and similar repositories for PGD
Users that are interested in PGD are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Parallel Maximum Clique Library☆118Aug 20, 2023Updated 2 years ago
- A novel approach to evaluate community detection algorithms on ground truth☆20Jun 24, 2021Updated 4 years ago
- Personalized Graph-based Retrieval for LLMs Benchmark☆34Feb 16, 2025Updated last year
- ☆42Oct 11, 2021Updated 4 years ago
- ☆13Apr 2, 2025Updated last year
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click and start building anything your business needs.
- Framework for latent network summarization: bridging network embedding and summarization☆10Sep 20, 2019Updated 6 years ago
- Drug-Likeness☆16Dec 11, 2022Updated 3 years ago
- Highly interactive graph data visualization☆15Oct 13, 2021Updated 4 years ago
- Temporal Motif Finder☆25Jan 15, 2017Updated 9 years ago
- A scalable Gensim implementation of "Learning Role-based Graph Embeddings" (IJCAI 2018).☆169Nov 6, 2022Updated 3 years ago
- A tool for parallel and distributed enumeration of cliques and diameter two kplexes.☆15Dec 24, 2022Updated 3 years ago
- Cross Entropy Low-rank Logits for graph generation.☆18Aug 2, 2024Updated last year
- Packed Memory Array☆17May 14, 2014Updated 11 years ago
- SparklingGraph documentation☆10Jan 7, 2020Updated 6 years ago
- DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Parallel solver for graph Laplacians from large social networks.☆11Jan 5, 2022Updated 4 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
- Python wrapper for the Kavosh network motif finder☆52Dec 8, 2014Updated 11 years ago
- Arya: Arbitrary Graph Pattern Mining with Decomposition-based Sampling☆16Sep 27, 2023Updated 2 years ago
- Telescopes, Workflows and Data Services for the Academic Observatory☆18Updated this week
- Accelerating Exact Constrained Shortest Paths on GPUs☆15Dec 11, 2020Updated 5 years ago
- Map Reduce Implementation of a community detection algorithm extending Louvain method for community detection.☆15Jan 13, 2016Updated 10 years ago
- Code for NeurIPS 2022 paper "Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discriminat…☆56Mar 6, 2023Updated 3 years ago
- ☆11Apr 8, 2023Updated 3 years ago
- Open source password manager - Proton Pass • AdSecurely store, share, and autofill your credentials with Proton Pass, the end-to-end encrypted password manager trusted by millions.
- ☆18Feb 20, 2026Updated last month
- A Framework for Graph Sampling and Random Walk on GPUs.☆38Feb 3, 2025Updated last year
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆30Jun 18, 2023Updated 2 years ago
- Community Detection for Twitter follower network of 40 million users using mapreduce☆16Nov 15, 2010Updated 15 years ago
- Stanford Network Analysis Platform (SNAP) is a general purpose network analysis and graph mining library.☆2,265Dec 10, 2023Updated 2 years ago
- GRAIL: A Scalable Index for Reachability Queries in Very Large Graphs☆16May 27, 2015Updated 10 years ago
- Old repo for R interface for GraphFrames☆13Mar 21, 2018Updated 8 years ago
- Quickly compute all maximal cliques of a graph☆80Oct 23, 2018Updated 7 years ago
- Python implementation of Kohler et al.'s random walk with restart☆29Sep 19, 2018Updated 7 years ago
- Wordpress hosting with auto-scaling on Cloudways • AdFully Managed hosting built for WordPress-powered businesses that need reliable, auto-scalable hosting. Cloudways SafeUpdates now available.
- An R package to call oomycete effectors☆11Aug 31, 2023Updated 2 years ago
- Simple implementation of two layers of Disentangled GCN☆13Mar 24, 2021Updated 5 years ago
- Count Min Sketch implementation for Rust☆14Feb 9, 2026Updated 2 months ago
- flexible pipelines for scalable secretome prediction, R package☆12Feb 21, 2019Updated 7 years ago
- Library for finding maximum cliques on graphs☆17Jan 11, 2022Updated 4 years ago
- Official implementation of 'All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretraining' published i…☆47Oct 23, 2024Updated last year
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆63Jun 9, 2021Updated 4 years ago