maxdan94 / Density-Friendly

Related projects ⓘ

Alternatives and complementary repositories for Density-Friendly

• kijungs / corescope
  CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)
  ☆15Updated 3 weeks ago
• LJeub / LocalCommunities
  Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …
  ☆13Updated 6 years ago
• KarypisLab / K-Truss
  OpenMP-based parallel software for computing the truss decomposition of a graph.
  ☆12Updated 6 years ago
• liyanghua / Label-Propagation
  Label Propagation based Community Detection algorithm implemented using multiprocessing module in python (Please have a look at my othe…
  ☆9Updated 14 years ago
• humayunk1 / PKC
  Parallel k-core Decomposition on Multicore Platforms
  ☆10Updated 4 years ago
• eXascaleInfolab / PyCABeM
  Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…
  ☆19Updated 5 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆0Updated 3 years ago
• athomo / kcore
  ☆10Updated 7 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 5 years ago
• DAMA-UPC / SCD
  ☆29Updated 7 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆24Updated 3 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆24Updated 2 years ago
• prathasah / random-modular-network-generator
  Generates random graphs with tunable strength of community structure
  ☆28Updated 5 years ago
• linhongseba / MaximumClique
  The implementation for maximum clique enumeration algorithm
  ☆11Updated 8 years ago
• M-Flash / m-flash-cpp
  ☆15Updated 6 years ago
• jg-you / dyvider
  Dynamic programming algorithms for exact linear clustering in networks.
  ☆16Updated last year
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 5 years ago
• giannisnik / k-clique-graphs-dense-subgraphs
  ☆16Updated 8 years ago
• yuj-umd / fastsc
  A fast implementation of spectral clustering on GPU-CPU Platform
  ☆30Updated 6 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆75Updated 6 years ago
• dbs-leipzig / giraph-algorithms
  Library of graph algorithms for Apache Giraph.
  ☆8Updated 8 years ago
• conradlee / network-community-benchmark
  For benchmaring community detection algorithms on social networks with meta-data
  ☆16Updated 10 years ago
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆24Updated 9 years ago
• uwescience / GossipMap
  GossipMap: distributed parallel community detection algorithm
  ☆21Updated 9 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆55Updated 2 years ago
• aaronmcdaid / Overlapping-NMI
  ☆51Updated 8 years ago
• cnmusco / graph-similarity-learning
  Algorithms for learning network structure from effective resistances and other random-walk-based similarities.
  ☆31Updated 6 years ago
• HanKruiger / tsnetwork
  (PLEASE USE https://github.com/HanKruiger/tsNET) This is here for historical purpose only.
  ☆10Updated 5 years ago
• greyfoxamine / Overlapping-Community-Detection-Using-Seed-Set-Expansion-
  ☆8Updated 7 years ago
• teapot-co / tempest
  Network storage and analytics library
  ☆27Updated 7 years ago