A Parallel Graphlet Decomposition Library for Large Graphs
☆90Mar 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☆124Aug 20, 2023Updated 3 years ago
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆18Mar 24, 2023Updated 3 years ago
- Netrate Matlab/CVX☆10Dec 25, 2012Updated 13 years ago
- ☆42Oct 11, 2021Updated 4 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆91Nov 14, 2019Updated 6 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- ☆13Apr 2, 2025Updated last year
- Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming☆11Feb 12, 2026Updated 7 months 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
- (PLEASE USE https://github.com/HanKruiger/tsNET) This is here for historical purpose only.☆10Mar 10, 2019Updated 7 years ago
- Cross Entropy Low-rank Logits for graph generation.☆19Jun 30, 2026Updated 3 months ago
- Packed Memory Array☆17May 14, 2014Updated 12 years ago
- SparklingGraph documentation☆10Jan 7, 2020Updated 6 years ago
- Python wrapper for the Kavosh network motif finder☆52Dec 8, 2014Updated 11 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- Parallel solver for graph Laplacians from large social networks.☆11Jan 5, 2022Updated 4 years ago
- Several graph clustering algorithms in one library☆18Oct 27, 2018Updated 7 years ago
- Telescopes, Workflows and Data Services for the Academic Observatory☆18Sep 17, 2026Updated 3 weeks ago
- Map Reduce Implementation of a community detection algorithm extending Louvain method for community detection.☆15Jan 13, 2016Updated 10 years ago
- Arya: Arbitrary Graph Pattern Mining with Decomposition-based Sampling☆18Sep 27, 2023Updated 3 years ago
- A Framework for Graph Sampling and Random Walk on GPUs.☆37Feb 3, 2025Updated last year
- Code for NeurIPS 2022 paper "Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discriminat…☆55Mar 6, 2023Updated 3 years ago
- ☆18Feb 20, 2026Updated 7 months ago
- ☆11Apr 8, 2023Updated 3 years ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Stanford Network Analysis Platform (SNAP) is a general purpose network analysis and graph mining library.☆2,291Dec 10, 2023Updated 2 years ago
- time series anomaly detection using rnns for my thesis☆11Feb 12, 2016Updated 10 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Jun 11, 2021Updated 5 years ago
- GRAIL: A Scalable Index for Reachability Queries in Very Large Graphs☆16May 27, 2015Updated 11 years ago
- Quickly compute all maximal cliques of a graph☆83Oct 23, 2018Updated 7 years ago
- Graph homomorphism and retract searching☆11Aug 5, 2015Updated 11 years ago
- Python implementation of Kohler et al.'s random walk with restart☆28Sep 19, 2018Updated 8 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 3 years ago
- Spectral Graph Attention Network with Fast Eigen-approximation☆11Dec 24, 2021Updated 4 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- A Modular Library for Computing Tree Decompositions☆17Sep 26, 2024Updated 2 years ago
- FRAMA: From RNA-seq data to annotated mRNA assemblies☆12Sep 28, 2018Updated 8 years ago
- Graffinity: Visualizing Connectivity in Large Graphs☆28Mar 1, 2022Updated 4 years ago
- Quality scores to evaluate network partitions☆12Apr 28, 2024Updated 2 years ago
- Towards Understanding Deep Learning Representations via Interactive Experimentation☆24May 5, 2017Updated 9 years ago
- The implementation of the algorithm proposed in A Principled Massive-Graph Similarity Function, and improvement of this algorith.☆15Nov 12, 2016Updated 9 years ago
- Code for "COEVOLVE: A Joint Point Process Model for Information Diffusion and Network Co-evolution", NIPS 2015☆11Jan 4, 2016Updated 10 years ago