Alternatives and similar repositories for cp2015-subgraph-isomorphism:

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

• 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
• narayanan2004 / GraphMat
  GraphMat graph analytics framework
  ☆101Updated 2 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
• sslab-gatech / mosaic
  ☆82Updated 7 years ago
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 7 years ago
• dmargo / sheep
  A scalable distributed graph partitioner. Ongoing research.
  ☆15Updated 7 years ago
• graphchallenge / GraphChallenge
  Graph Challenge
  ☆31Updated 5 years ago
• jacobratkiewicz / webgraph
  Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)
  ☆30Updated 7 months ago
• netsyslab / Totem
  A graph processing engine for hybrid CPU and GPU platforms
  ☆38Updated 6 years ago
• niklasso / minisatp
  The Pseudo-Boolean Solver MiniSat+
  ☆27Updated 12 years ago
• nilehmann / libk2tree
  k2tree implementation
  ☆10Updated 8 years ago
• cmu-sei / gbtl
  GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org
  ☆133Updated last year
• LLNL / havoqgt
  ☆26Updated 2 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• conradlee / network-community-benchmark
  For benchmaring community detection algorithms on social networks with meta-data
  ☆17Updated 10 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 5 years ago
• robmccoll / graphdb-testing
  Benchmarking various graph databases, engines, datastructures, and data stores.
  ☆35Updated 11 years ago
• stanford-ppl / Green-Marl
  A DSL for efficient Graph Analysis
  ☆101Updated 6 years ago
• Adam27X / hybrid_BC
  Hybrid methods for Parallel Betweenness Centrality on the GPU
  ☆24Updated 6 years ago
• alex-87 / HyperGraphLib
  C++ Hypergraph modelling Library using Boost and OpenMP with some algorithms, including isomorphism using Gecode.
  ☆21Updated 2 years ago
• goatdb / llama
  LLAMA Graph Analytics Engine
  ☆41Updated 7 years ago
• alihadian / ROLL
  ROLL: Fast In-Memory Generation of Gigantic Scale-free Networks
  ☆11Updated 7 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• Jokeren / gBolt
  gBolt--very fast implementation for gSpan algorithm in data mining
  ☆56Updated 3 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆37Updated last month
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆31Updated 7 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…
  ☆112Updated last year
• jessecoleman / gbtl-python-bindings
  ☆11Updated 6 years ago
• gbagan / gmark
  ☆42Updated 2 years ago
• hornet-gt / hornet
  Hornet data structure for sparse dynamic graphs and matrices
  ☆82Updated 5 years ago