Sampler algorithm which is implemented in UndirectedGraph class's sampler method selects a set of edges from a undirected simple graph with given probabilities so that this edges could be used to estimate the count of different motifs that is indicated in the research paper "Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts". This java program's purpose is to provide a more restricted selection way to improve the sampler algorithm.
didar00 / 4-vertex-subgraph-count-estimation-in-java Goto Github PK
View Code? Open in Web Editor NEWDetermining the number of 4-vertex subgraphs in a massive undirected graph without counting all of the subgraphs. Implemented in Java.