darrenstrash / open-mcs

Related projects ⓘ

Alternatives and complementary repositories for open-mcs

• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆17Updated 2 years ago
• jwalteros / dOmega
  Library for finding maximum cliques on graphs
  ☆15Updated 2 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆75Updated 6 years ago
• mabseher / htd
  A small but efficient C++ library for computing (customized) tree and hypertree decompositions.
  ☆48Updated last year
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆24Updated 3 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆35Updated this week
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆24Updated 2 years ago
• athomo / kcore
  ☆10Updated 7 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 5 years ago
• alex-87 / HyperGraphLib
  C++ Hypergraph modelling Library using Boost and OpenMP with some algorithms, including isomorphism using Gecode.
  ☆21Updated 2 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 4 years ago
• mayerrn / HYPE
  Implementation of the HYPE hypergraph partitioner.
  ☆17Updated 4 years ago
• hornet-gt / hornet
  Hornet data structure for sparse dynamic graphs and matrices
  ☆80Updated 5 years ago
• humayunk1 / PKC
  Parallel k-core Decomposition on Multicore Platforms
  ☆10Updated 4 years ago
• uwescience / GossipMap
  GossipMap: distributed parallel community detection algorithm
  ☆21Updated 9 years ago
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆23Updated last month
• ciaranm / cp2015-subgraph-isomorphism
  CP 2015 subgraph isomorphism experiments, data and paper
  ☆13Updated 9 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆27Updated 7 months ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 5 years ago
• dnasc / graph-processing
  This repository contains information about graph processing.
  ☆31Updated 3 months ago
• linhongseba / MaximumClique
  The implementation for maximum clique enumeration algorithm
  ☆11Updated 8 years ago
• RoyalCaliber / vertexAPI2
  A vertex-centric CUDA/C++ API for large graph analytics on GPUs using the Gather-Apply-Scatter abstraction
  ☆23Updated 10 years ago
• cmu-sei / gbtl
  GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org
  ☆131Updated last year
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆0Updated 3 years ago
• xibosun / paper_list
  The repo lists papers of various areas, including Graph Analytics, Graph Acceleration, Subgraph Matching, Streaming Graph Management, Wor…
  ☆14Updated 4 years ago
• RapidsAtHKUST / AccTrussDecomposition
  Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …
  ☆14Updated 4 years ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆19Updated 3 years ago
• Gecode / MPG
  Modeling and Programming with Gecode
  ☆45Updated 2 years ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆72Updated 2 weeks ago