Alternatives and similar repositories for kdd20-mosso

Users that are interested in kdd20-mosso are comparing it to the libraries listed below

• geon0325 / MoCHy
  Source code for VLDB 2020 paper "Hypergraph Motifs: Concepts, Algorithms, and Discoveries."
  ☆17Updated last year
• young917 / www21-hyperlap
  WWW21 - How Do Hyperedges Overlap
  ☆16Updated last year
• yunbum-kook / icdm20-hyperff
  ☆13Updated 4 years ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆32Updated 4 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆164Updated 2 years ago
• wuhao-wu-jiang / Personalized-PageRank
  ☆14Updated 4 years ago
• mayerrn / hybrid_edge_partitioner
  ☆19Updated 4 years ago
• flyingdoog / RWM
  Local Community Detection in Multiple Netwrks
  ☆15Updated 9 months ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆54Updated last year
• manhtuando97 / KDD-20-Hypergraph
  Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"
  ☆32Updated last year
• GemsLab / StrucEmbedding-GraphLibrary
  The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.
  ☆18Updated 2 years ago
• zexihuang / random-walk-embedding
  A Broader Picture of Random-walk Based Graph Embedding
  ☆30Updated 4 years ago
• Cecca / ugraph
  Code and data for the Clustering Uncertain Graphs paper
  ☆10Updated 3 years ago
• xptree / LightNE
  ☆24Updated 3 years ago
• AnryYang / PANE
  Official Implementation for "Scaling Attributed Network Embedding to Massive Graphs"
  ☆18Updated last year
• KyuhanLee / SSumM
  SSumM: Sparse Summarization of Massive Graphs
  ☆19Updated 5 years ago
• Kangfei / LSS
  Released code for [sigmod'21] A learned Sketch for Subgraph Counting
  ☆21Updated 4 years ago
• chlehdwon / RDB2G-Bench
  [NeurIPS 2025 Datasets and Benchmarks] Source code for the paper RDB2G-Bench: A Comprehensive Benchmark for Automatic Graph Modeling of R…
  ☆20Updated last week
• arbenson / ScHoLP-Data
  Data for the paper "Simplicial closure and higher-order link prediction"
  ☆22Updated 7 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆18Updated 7 years ago
• IllinoisGraphBenchmark / IGB-Datasets
  Largest realworld open-source graph dataset - Worked done under IBM-Illinois Discovery Accelerator Institute and Amazon Research Awards a…
  ☆85Updated 6 months ago
• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆32Updated 4 years ago
• fabiopetroni / VGP
  A software package for one-pass Vertex-cut balanced Graph Partitioning.
  ☆32Updated 10 years ago
• asajadi / fast-pagerank
  Fast (Personalized) PageRank Implementation
  ☆69Updated 2 years ago
• PhilChodrow / HypergraphModularity
  Code for generative hypergraph clustering via modularity-like objective functions.
  ☆25Updated 3 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆25Updated 4 years ago
• Ashish7129 / Graph_Sampling
  Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.
  ☆164Updated 5 years ago
• amazon-science / tgl
  ☆216Updated last year
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 7 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago