Alternatives and similar repositories for breaking_cycles_in_noisy_hierarchies

Users that are interested in breaking_cycles_in_noisy_hierarchies are comparing it to the libraries listed below

• caesar0301 / graphsim
  Graph similarity algorithms based on NetworkX.
  ☆170Updated 6 years ago
• timtadh / zhang-shasha
  Tree edit distance using the Zhang Shasha algorithm
  ☆456Updated 5 years ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆104Updated 2 years ago
• jajupmochi / graphkit-learn
  A python package for graph kernels, graph edit distances, and graph pre-image problem.
  ☆128Updated 5 months ago
• kfoynt / LocalGraphClustering
  ☆144Updated 4 years ago
• kerighan / graph-walker
  Fastest random walks generator on networkx graphs
  ☆75Updated last year
• RobRomijnders / bigclam
  Implements the bigCLAM algorithm
  ☆52Updated 5 years ago
• VHRanger / CSRGraph
  A tiny library for larger graphs
  ☆119Updated last year
• jacquesfize / GMatch4py
  A graph matching library for Python
  ☆208Updated last year
• theSage21 / lorentz-embeddings
  Embed arbitrary graphs in Hyperbolic space
  ☆76Updated 3 years ago
• benedekrozemberczki / graph2vec
  A parallel implementation of "graph2vec: Learning Distributed Representations of Graphs" (MLGWorkshop 2017).
  ☆927Updated 3 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆89Updated 6 years ago
• IBM / pyflowgraph
  Flow graphs for Python
  ☆26Updated 3 years ago
• Kappa-Dev / ReGraph
  Tool for building graph-based hierarchical knowledge representation systems
  ☆87Updated 2 years ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆133Updated 4 years ago
• aplbrain / dotmotif
  A performant, powerful query framework to search for network motifs
  ☆89Updated 4 months ago
• typilus / typilus
  Code for "Typilus: Neural Type Hints" PLDI 2020
  ☆62Updated 2 years ago
• Jokeren / gBolt
  gBolt--very fast implementation for gSpan algorithm in data mining
  ☆58Updated 4 years ago
• xgfs / NetLSD
  NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
  ☆61Updated 5 years ago
• louisabraham / fastnode2vec
  Fast and scalable node2vec implementation
  ☆97Updated 2 years ago
• microsoft / dpu-utils
  Utilities used by the Deep Program Understanding team
  ☆103Updated 2 years ago
• DerwenAI / disparity_filter
  Implements a disparity filter in Python, based on graphs in NetworkX, to extract the multiscale backbone of a complex weighted network (S…
  ☆35Updated 3 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆55Updated 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.
  ☆163Updated 4 years ago
• wdimmy / MeTeoR
  ☆22Updated last year
• GiulioRossetti / cdlib
  Community Discovery Library
  ☆407Updated last month
• ML-KULeuven / PySDD
  Python package for Sentential Decision Diagrams (SDD)
  ☆67Updated 8 months ago
• microsoft / graph-based-code-modelling
  Code for "Generative Code Modeling with Graphs" (ICLR'19)
  ☆171Updated 2 years ago
• dselsam / neurosat
  NeuroSAT: Learning a SAT Solver from Single-Bit Supervision
  ☆288Updated 6 years ago
• linqs / psl
  The PSL software from the University of Maryland and the University of California Santa Cruz
  ☆308Updated last year