Alternatives and similar repositories for cp2015-subgraph-isomorphism

Users that are interested in cp2015-subgraph-isomorphism are comparing it to the libraries listed below

• alex-87 / HyperGraphLib
  C++ Hypergraph modelling Library using Boost and OpenMP with some algorithms, including isomorphism using Gecode.
  ☆21Updated 2 years ago
• sslab-gatech / mosaic
  ☆82Updated 7 years ago
• farkhor / CuSha
  CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.
  ☆52Updated 9 years ago
• jacobratkiewicz / webgraph
  Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)
  ☆31Updated 11 months ago
• robmccoll / graphdb-testing
  Benchmarking various graph databases, engines, datastructures, and data stores.
  ☆37Updated 11 years ago
• robmccoll / stinger
  The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…
  ☆11Updated 9 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• stanford-ppl / Green-Marl
  A DSL for efficient Graph Analysis
  ☆102Updated 6 years ago
• narayanan2004 / GraphMat
  GraphMat graph analytics framework
  ☆102Updated 2 years ago
• cmu-sei / gbtl
  GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org
  ☆134Updated 2 years ago
• netsyslab / Totem
  A graph processing engine for hybrid CPU and GPU platforms
  ☆38Updated 6 years ago
• goatdb / llama
  LLAMA Graph Analytics Engine
  ☆41Updated 7 years ago
• gh-rdf3x / gh-rdf3x
  Extension of the rdf3x engine and the translatesparql tool.
  ☆45Updated 11 years ago
• gbagan / gmark
  ☆43Updated 2 years ago
• stingergraph / stinger
  The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…
  ☆212Updated 6 months ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 5 years ago
• ACSAlab / olive
  A Lightweight Graph Processing Framework for Multi-GPUs
  ☆14Updated 10 years ago
• RoyalCaliber / vertexAPI2
  A vertex-centric CUDA/C++ API for large graph analytics on GPUs using the Gather-Apply-Scatter abstraction
  ☆23Updated 11 years ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 3 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆1Updated 4 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• nilehmann / libk2tree
  k2tree implementation
  ☆10Updated 8 years ago
• graphchallenge / GraphChallenge
  Graph Challenge
  ☆31Updated 5 years ago
• xvz / graph-processing
  Comparison of graph processing systems.
  ☆23Updated 8 years ago
• karlsruhedraw / KaDraw
  This the open source graph drawing package KaDraw (Karlsruhe Graph Drawing).
  ☆10Updated last year
• niklasso / minisatp
  The Pseudo-Boolean Solver MiniSat+
  ☆27Updated 12 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 7 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆88Updated 6 years ago
• hornet-gt / hornetsnest
  High-Performance Streaming Graph Analytics on GPUs
  ☆33Updated 6 years ago