Alternatives and similar repositories for Densest-Subgraph-Discovery:

Users that are interested in Densest-Subgraph-Discovery are comparing it to the libraries listed below

• Chen-Cai-OSU / LDP
  LDP for graph classification
  ☆23Updated 5 years ago
• TheGravLab / A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening
  Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)
  ☆16Updated 4 years ago
• kfoynt / LocalGraphClustering
  ☆137Updated 3 years ago
• flyingdoog / RWM
  Local Community Detection in Multiple Netwrks
  ☆14Updated 2 years ago
• egalimberti / multilayer_core_decomposition
  Core Decomposition in Multilayer Networks: Theory, Algorithms, and Applications
  ☆11Updated 6 years ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆103Updated last year
• ZW-ZHANG / AROPE
  This is the official implementation of "Arbitrary-Order Proximity Preserved Network Embedding"(KDD 2018).
  ☆38Updated 5 years ago
• chrsmrrs / sparsewl
  Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"
  ☆22Updated 2 years ago
• egalimberti / polarized_communities
  Discovering Polarized Communities in Signed Networks
  ☆13Updated 5 years ago
• hheidrich / CELL
  Cross Entropy Low-rank Logits for graph generation.
  ☆18Updated 5 months ago
• floklimm / hypergraph
  Library of python functions for the analysis of hypergraphs.
  ☆12Updated 3 years ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 5 years ago
• arbenson / ScHoLP-Data
  Data for the paper "Simplicial closure and higher-order link prediction"
  ☆19Updated 6 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆60Updated 3 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 5 years ago
• manhtuando97 / KDD-20-Hypergraph
  Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"
  ☆31Updated 2 months ago
• tadpole / DHNE
  the Implementation of "Structural Deep Embedding for Hyper-Networks"（AAA20I8）
  ☆45Updated 5 years ago
• young917 / www21-hyperlap
  WWW21 - How Do Hyperedges Overlap
  ☆16Updated 11 months ago
• lundu28 / GNE
  Galaxy Network Embedding: A Hierarchical Community Structure Preserving Approach
  ☆16Updated 5 years ago
• HipGraph / MarkovGNN
  PyTorch-Geometric Implementation of MarkovGNN method published in Graph Learning@WWW 2022 titled "MarkovGNN: Graph Neural Networks on Mar…
  ☆15Updated 2 years ago
• joint-em / FirmCore
  FirmCore Decomposition of Multilayer Networks
  ☆7Updated 2 years ago
• sizhang92 / FINAL-KDD16
  Matlab code for the method proposed in "Final: Fast attributed network alignment" (KDD'16)
  ☆29Updated 3 years ago
• NaazS03 / cgSpan
  Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.
  ☆10Updated 3 years ago
• Ashish7129 / Graph_Sampling
  Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.
  ☆161Updated 4 years ago
• GraphPKU / I2GNN
  official code for I2GNN.
  ☆12Updated last year
• gaoji7777 / walign
  Wasserstein Distance Graph Alignment
  ☆22Updated 3 years ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆69Updated 2 years ago
• houchengbin / GloDyNE
  GloDyNE: Global Topology Preserving Dynamic Network Embedding (accepted by IEEE TKDE in 2020) https://ieeexplore.ieee.org/document/930271…
  ☆65Updated 3 years ago
• cornell-zhang / GraphZoom
  GraphZoom: A Multi-level Spectral Approach for Accurate and Scalable Graph Embedding
  ☆114Updated last year
• flyingtango / DiGCN
  Implement of DiGCN, NeurIPS-2020
  ☆48Updated 3 years ago