Commit 1d65c571 authored by Alexis Baudin's avatar Alexis Baudin
Browse files

Update README.md

parent 44c6729a
......@@ -6,20 +6,20 @@
In the following, the programs are run with:
- $k \geq 3$
- k >= 3
- edgelist.txt: an edge per line represented by two nodes separated with space
## $k$-clique streaming
## k-clique streaming
To generate the stream of $k$-cliques from a graph, execute:
To generate the stream of k-cliques from a graph, execute:
> ./kClist-stdout.o k edgelist.txt
## Exact CPM
The program takes as input a stream of $(k-1)$-clique followed by a stream of $k$-clique, separated by the character 'X'. It computes the $k$-clique communities by percolation.
The program takes as input a stream of $(k-1)$-clique followed by a stream of k-clique, separated by the character 'X'. It computes the k-clique communities by percolation.
To count the $k$-clique communities :
To count the k-clique communities :
> bash cpm.sh k edgelist.txt
......@@ -29,9 +29,9 @@ To list the communities in the standard output :
## CPMZ
The program takes as input a stream of $(k-1)$-clique followed by a stream of $k$-clique, separated by the character 'X'. It computes memory efficient approximate solution of CPMZ.
The program takes as input a stream of (k-1)-clique followed by a stream of k-clique, separated by the character 'X'. It computes memory efficient approximate solution of CPMZ.
To count the relaxed $k$-clique communities :
To count the relaxed k-clique communities :
> bash cpmz.sh z k edgelist.txt
......@@ -39,6 +39,4 @@ To list these communities in the standard output :
> bash cpm.sh z k edgelist.txt --write-commus
With $2 \geq z \geq k-1$
##
With 2 <= z <= k-1
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment