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
- Netrate Matlab/CVX☆10Dec 25, 2012Updated 13 years ago
- ☆42Oct 11, 2021Updated 4 years ago
- Personalized Graph-based Retrieval for LLMs Benchmark☆34Feb 16, 2025Updated last year
- ☆13Apr 2, 2025Updated last year
- 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.
- Framework for latent network summarization: bridging network embedding and summarization☆10Sep 20, 2019Updated 7 years ago
- Temporal Motif Finder☆25Jan 15, 2017Updated 9 years ago
- (PLEASE USE https://github.com/HanKruiger/tsNET) This is here for historical purpose only.☆10Mar 10, 2019Updated 7 years ago
- An open implementation of the MC family of maximum clique algorithms☆14Aug 4, 2016Updated 10 years ago
- community detection in multiplex networks☆10Apr 23, 2016Updated 10 years ago
- A tool for parallel and distributed enumeration of cliques and diameter two kplexes.☆15Dec 24, 2022Updated 3 years ago
- Python wrapper for the Kavosh network motif finder☆52Dec 8, 2014Updated 11 years ago
- Parallel solver for graph Laplacians from large social networks.☆11Jan 5, 2022Updated 4 years ago
- Telescopes, Workflows and Data Services for the Academic Observatory☆18Updated this week
- 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.
- Code for "Graph Neural Networks can Recover the Hidden Features Solely from the Graph Structure" (ICML 2023)☆24Jun 1, 2023Updated 3 years ago
- Accelerating Exact Constrained Shortest Paths on GPUs☆15Dec 11, 2020Updated 5 years ago
- Arya: Arbitrary Graph Pattern Mining with Decomposition-based Sampling☆18Sep 27, 2023Updated 2 years ago
- Highly interactive graph data visualization☆15Oct 13, 2021Updated 4 years ago
- Code for the paper "Higher-order motif analysis in hypergraphs"☆36Apr 5, 2022Updated 4 years ago
- ☆11Apr 8, 2023Updated 3 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Jun 18, 2023Updated 3 years ago
- Stanford Network Analysis Platform (SNAP) is a general purpose network analysis and graph mining library.☆2,290Dec 10, 2023Updated 2 years ago
- An MLIR-based compiler targeting Kokkos and other programming models☆18Jul 30, 2026Updated last month
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- 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☆82Oct 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☆29Sep 19, 2018Updated 8 years ago
- Crime correlation anaysis☆10Aug 8, 2018Updated 8 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 3 years ago
- FREIGHT: Fast Streaming Hypergraph Partitioning — SEA 2023 Best Paper Award☆16Apr 15, 2026Updated 5 months ago
- Spectral Graph Attention Network with Fast Eigen-approximation☆11Dec 24, 2021Updated 4 years ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- A Modular Library for Computing Tree Decompositions☆17Sep 26, 2024Updated last year
- Graffinity: Visualizing Connectivity in Large Graphs☆28Mar 1, 2022Updated 4 years ago
- Simple implementation of two layers of Disentangled GCN☆13Mar 24, 2021Updated 5 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