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."
  ☆16Updated 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
  ☆31Updated 4 years ago
• AnryYang / PANE
  Official Implementation for "Scaling Attributed Network Embedding to Massive Graphs"
  ☆17Updated last year
• mayerrn / hybrid_edge_partitioner
  ☆18Updated 3 years ago
• wuhao-wu-jiang / Personalized-PageRank
  ☆14Updated 3 years ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆54Updated last year
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆159Updated last year
• flyingdoog / RWM
  Local Community Detection in Multiple Netwrks
  ☆15Updated 5 months ago
• zexihuang / random-walk-embedding
  A Broader Picture of Random-walk Based Graph Embedding
  ☆30Updated 4 years ago
• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆31Updated 3 years ago
• manhtuando97 / KDD-20-Hypergraph
  Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"
  ☆31Updated 9 months ago
• Kangfei / LSS
  Released code for [sigmod'21] A learned Sketch for Subgraph Counting
  ☆19Updated 3 years ago
• arbenson / ScHoLP-Data
  Data for the paper "Simplicial closure and higher-order link prediction"
  ☆21Updated 6 years ago
• IllinoisGraphBenchmark / IGB-Datasets
  Largest realworld open-source graph dataset - Worked done under IBM-Illinois Discovery Accelerator Institute and Amazon Research Awards a…
  ☆84Updated last month
• K-Kyungho / PET
  Official code for "Towards Better Utilzation of Multiple Views for Bundle Recommendation" (CIKM 24 Short)
  ☆20Updated 7 months ago
• xptree / LightNE
  ☆24Updated 3 years ago
• yqc01 / BESIDE
  (BESIDE) ``Bridge” Enhanced Signed Directed Network Embedding
  ☆11Updated 6 years ago
• CUAI / Non-Homophily-Large-Scale
  [NeurIPS 2021] Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods
  ☆124Updated 3 years ago
• chlehdwon / RDB2G-Bench
  Source code for the paper RDB2G-Bench: A Comprehensive Benchmark for Automatic Graph Modeling of Relational Databases
  ☆16Updated 2 weeks ago
• CGCL-codes / Pensieve
  Pensieve is a skewness-aware multi-version graph processing system that exploits the time locality of graph version access and leverages …
  ☆21Updated 3 years ago
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆130Updated 3 weeks ago
• szzhang17 / Scaling-Up-Graph-Neural-Networks-Via-Graph-Coarsening
  Code for the KDD 2021 paper "Scaling Up Graph Neural Networks Via Graph Coarsening"
  ☆28Updated last year
• RapidsAtHKUST / ContinuousSubgraphMatching
  Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…
  ☆50Updated 2 years ago
• loukasa / graph-coarsening
  Multilevel graph coarsening algorithm with spectral and cut guarantees
  ☆90Updated 5 years ago
• 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
• fabiopetroni / VGP
  A software package for one-pass Vertex-cut balanced Graph Partitioning.
  ☆32Updated 10 years ago
• KyuhanLee / SSumM
  SSumM: Sparse Summarization of Massive Graphs
  ☆19Updated 5 years ago
• NAVER-INTEL-Co-Lab / gaudi-geometric-learning
  Handbook for Geometric Deep Learning with Intel Gaudi-v2 Devices
  ☆20Updated 5 months ago