Alternatives and similar repositories for Nass:

Users that are interested in Nass are comparing it to the libraries listed below

• Kangfei / LSS
  Released code for [sigmod'21] A learned Sketch for Subgraph Counting
  ☆18Updated 3 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆150Updated last year
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆53Updated 6 months ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 4 years ago
• 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…
  ☆46Updated last year
• Starlien95 / Count-GNN
  Learning to Count Isomorphisms with Graph Neural Networks
  ☆13Updated last year
• AnryYang / PANE
  Official Implementation for "Scaling Attributed Network Embedding to Massive Graphs"
  ☆17Updated last year
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• JackChuengQAQ / SubgraphMatchingSurvey
  The source code of "A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction"
  ☆10Updated 5 months ago
• wuhao-wu-jiang / Personalized-PageRank
  ☆13Updated 3 years ago
• Indradyumna / ISONET
  ☆27Updated 3 months ago
• ChengzhiPiao / GEDGNN
  The code repository of paper "Computing Graph Edit Distance via Neural Graph Matching" for PVLDB 2023.
  ☆18Updated last year
• Gawssin / kCliqueListing
  a k-cliques algorithm
  ☆17Updated 3 years ago
• ehab-abdelhamid / GraMi
  GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…
  ☆111Updated last year
• zexihuang / random-walk-embedding
  A Broader Picture of Random-walk Based Graph Embedding
  ☆30Updated 3 years ago
• XuanzhouLiu / D2Match-ICML23
  Implementation of paper "D2Match: Leveraging Deep Learning and Degeneracy for Subgraph Matching"
  ☆12Updated last year
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆24Updated 2 years ago
• wanghzccls / AGP-Approximate_Graph_Propagation
  Approximate Graph Propagation
  ☆11Updated 3 years ago
• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆31Updated 3 years ago
• yspark-dblab / gcare
  ☆26Updated 2 years ago
• pkumod / timingsubg
  Codes of the paper "Time Constrained Continuous Subgraph Search Over Streaming Graphs. ICDE 2019: 1082-1093". Authors: Youhuan Li, Lei Zo…
  ☆12Updated 3 years ago
• IllinoisGraphBenchmark / IGB-Datasets
  Largest realworld open-source graph dataset - Worked done under IBM-Illinois Discovery Accelerator Institute and Amazon Research Awards a…
  ☆79Updated 2 months ago
• seven-echo / Dynamic-graph-dataset
  Dynamic graph/network dataset for dynamic graph/network embedding/representation
  ☆34Updated 4 years ago
• muhanzhang / NestedGNN
  ☆55Updated 3 years ago
• yunshengb / GraphSim
  ☆52Updated 5 years ago
• mayerrn / hybrid_edge_partitioner
  ☆18Updated 3 years ago
• joint-em / FirmCore
  FirmCore Decomposition of Multilayer Networks
  ☆7Updated 2 years ago
• SNUCSE-CTA / VEQ
  ☆13Updated 3 years ago
• PKU-DAIR / GAMLP
  Code of GAMLP for Open Graph Benchmark. KDD‘22
  ☆61Updated 2 years ago
• jihoonko / kdd20-mosso
  Official source code for MoSSo, described in the paper Incremental Lossless Graph Summarization, Jihoon Ko*, Yunbum Kook* and Kijung Shin…
  ☆15Updated 2 years ago