A sparsity aware implementation of "Biological Network Comparison Using Graphlet Degree Distribution" (Bioinformatics 2007)
-
Updated
Aug 11, 2022 - Python
A sparsity aware implementation of "Biological Network Comparison Using Graphlet Degree Distribution" (Bioinformatics 2007)
Cubic graph enumeration project based on "Fast generation of cubic graphs" paper.
subgraph enumeration on graphs using a memoized parallel ESU algorithm
A tool for detecting, analyzing, and visualizing network motifs
Level-6 generators of phylogenetic networks (OEIS A307185 a(6) = 5,539,121): code, certificates, and the generator sets, computed by two independent routes
Certified exhaustive streaming filter for graphs with prescribed cycle spectrum (Erdos-Gyarfas / rho2 = 11/7 campaign artifact)
Exhaustive enumeration of unlabeled Riordan graphs, i.e. graphs whose adjacency matrix is a Riordan array (g,f) over Z₂. Computes u(n) for n≤17 by two independent C++/nauty methods (a third for n≤10), lists every graph with its generating functions and matrices, and samples them uniformly. Data, logs and tests included for full reproducibility..
Exhaustive enumeration of connected graphs up to eleven vertices by the contextuality gap, with exact certified values of the Lovasz theta number for every maximizer
To associate your repository with the graph-enumeration topic, visit your repo's landing page and select "manage topics."