Luftschlange / ms-skim
Very fast and scalable algorithms for the influence maximization and influence estimation problems in the independent cascade model.
☆25Updated 8 years ago
Related projects: ⓘ
- An evolutionary multi-start algorithm for the Steiner Tree Problem in graphs with a fast local search.☆13Updated 2 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆85Updated 5 years ago
- ☆16Updated 6 years ago
- Near-linear time algorithm for computing near-maximum independent set☆16Updated 2 years ago
- ☆9Updated 7 years ago
- Graph kernels☆56Updated 2 years ago
- gSpan, an efficient algorithm for mining frequent subgraphs☆17Updated 4 years ago
- Source code for blog post at https://hautahi.com/im_greedycelf☆28Updated 4 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆51Updated 3 years ago
- Code for benhcmarking 12 state-of-the-art methods in the field of Influence Maximization☆19Updated 7 years ago
- Official Implementation for "Scaling Attributed Network Embedding to Massive Graphs"☆16Updated 7 months ago
- Framework for generating adversarial examples using formal methods and for analyzing robustness of DNNs.☆21Updated 7 years ago
- Code and data for experiments with evolutionary influence maximization☆16Updated 4 years ago
- Algorithms for online influence maximization☆19Updated 7 years ago
- ☆29Updated last year
- ☆12Updated 3 years ago
- Implementation of Influence Maximisation on a graph dataset.☆15Updated 5 years ago
- The project is trying to find the most influential group of nodes in a huge social network.（SUSTech AI lab3）☆22Updated 5 years ago
- Parallel Frequent Subgraph Mining☆28Updated 6 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆52Updated 6 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆25Updated 2 years ago
- ☆29Updated last year
- Source code for blog post at https://hautahi.com/im_ris☆11Updated 5 years ago
- Generalized Conventional Mutual Information (GenConvMI) - NMI for overlapping (soft, fuzzy) clusters (communities), compatible with stand…☆20Updated 3 years ago
- Codes for TopPPR☆13Updated 5 years ago
- Algorithms to list k-cliques in real-world graphs☆24Updated 3 years ago
- Code for Influence Maximization Problem☆26Updated 6 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆68Updated last month
- NetworkX Addon to allow graph partitioning with METIS☆79Updated last year
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆31Updated 2 years ago