3 results for “topic:dense-graph”
VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
This method incorporates dense linkage disequilibrium block structure of SNPs for prioritizing a set of genetic variants using GWAS summary statisticis before performing fine-mapping.
This repository implements three maximal clique enumeration algorithms from notable research papers. Optimized for sparse and dense graphs, it includes C/C++ code with sample datasets for benchmarking and runtime analysis.