https://sourceforge.net/p/cosparallel/wiki/MaximalCliquesListing/Recent changes to MaximalCliquesListingenWed, 27 Jun 2012 14:38:37 -0000https://sourceforge.net/p/cosparallel/wiki/MaximalCliquesListing/<pre>--- v9 +++ v10 @@ -1,6 +1,6 @@ Listing all the maximal cliques of a graph is an old, widely studied problem and a lot of algorithms have been proposed so far. One of the fastest algorithms is the one of [Bron-Kerbosh][1]. Its implementation is freely available in the [igraph][2] C library, *starting from version 0.6*. -Is there something ready for use? +Is there something ready to list maximal cliques? --------------------------------- Yes. We created a simple c program which uses the Bron-Kerbosh algorithm implementation available in [igraph][2]. **Be sure to have igraph-0.6 or above installed**, otherwise you can download it from [here][3]. The sources are available in the file `extras/maximal_cliques.c`. To compile it, `cd` to the directory where you downloaded the sources of **COS**, then `cd` to the `extras` directory and run `make`. This will create the executable `maximal_cliques` in the same folder. The file with extension .mcliques that `maximal_cliques` delivers as output can directly be used as input for **COS** (see its [UserGuide]). </pre>Simone MainardiWed, 27 Jun 2012 14:38:37 -0000https://sourceforge.net2ba3ca526012de5230c3710bbc0ad8d24de601dbhttps://sourceforge.net/p/cosparallel/wiki/MaximalCliquesListing/<pre>--- v8 +++ v9 @@ -2,7 +2,7 @@ Is there something ready for use? --------------------------------- -Yes. We created a simple c program which uses the Bron-Kerbosh algorithm implementation available in [igraph][2]. **Be sure to have igraph-0.6 or above installed**, otherwise you can download it from [here][3]. The sources are available in the file `extras/maximal_cliques.c`. To compile it, `cd` to the directory where you downloaded the sources of **COS**, then `cd` to the `extras` directory and run `make`. This will create the executable `maximal_cliques` in the same folder. As discussed below, the executable `maximal_cliques` delivers as output a file with extension .mcliques. This file can directly be used as input for **COS** (see [UserGuide]). +Yes. We created a simple c program which uses the Bron-Kerbosh algorithm implementation available in [igraph][2]. **Be sure to have igraph-0.6 or above installed**, otherwise you can download it from [here][3]. The sources are available in the file `extras/maximal_cliques.c`. To compile it, `cd` to the directory where you downloaded the sources of **COS**, then `cd` to the `extras` directory and run `make`. This will create the executable `maximal_cliques` in the same folder. The file with extension .mcliques that `maximal_cliques` delivers as output can directly be used as input for **COS** (see its [UserGuide]). #### Usage ##### </pre>Simone MainardiWed, 27 Jun 2012 13:42:20 -0000https://sourceforge.netb31cc9e183a1fe35f023d2e3f76350af58ac228ehttps://sourceforge.net/p/cosparallel/wiki/MaximalCliquesListing/<pre>--- v7 +++ v8 @@ -2,7 +2,7 @@ Is there something ready for use? --------------------------------- -Yes. We created a simple c program which uses the Bron-Kerbosh algorithm implementation available in [igraph][2]. **Be sure to have igraph-0.6 or above installed**, otherwise you can download it from [here][3]. The sources are available in the file `extras/maximal_cliques.c`. To compile it, `cd` to the directory where you downloaded the sources of **COS**, then `cd` to the `extras` directory and run `make`. This will create the executable `maximal_cliques` in the same folder. +Yes. We created a simple c program which uses the Bron-Kerbosh algorithm implementation available in [igraph][2]. **Be sure to have igraph-0.6 or above installed**, otherwise you can download it from [here][3]. The sources are available in the file `extras/maximal_cliques.c`. To compile it, `cd` to the directory where you downloaded the sources of **COS**, then `cd` to the `extras` directory and run `make`. This will create the executable `maximal_cliques` in the same folder. As discussed below, the executable `maximal_cliques` delivers as output a file with extension .mcliques. This file can directly be used as input for **COS** (see [UserGuide]). #### Usage ##### </pre>Simone MainardiWed, 27 Jun 2012 13:38:47 -0000https://sourceforge.net444e57da8cdf2e79587ba7e19de6aa72ef2e563bhttps://sourceforge.net/p/cosparallel/wiki/MaximalCliquesListing/<pre>--- v6 +++ v7 @@ -4,7 +4,7 @@ --------------------------------- Yes. We created a simple c program which uses the Bron-Kerbosh algorithm implementation available in [igraph][2]. **Be sure to have igraph-0.6 or above installed**, otherwise you can download it from [here][3]. The sources are available in the file `extras/maximal_cliques.c`. To compile it, `cd` to the directory where you downloaded the sources of **COS**, then `cd` to the `extras` directory and run `make`. This will create the executable `maximal_cliques` in the same folder. -### Usage #### +#### Usage ##### ./maximal_cliques <input_edgelist_file> @@ -12,9 +12,33 @@ * `<input_edgeslist_file>` is a generic symbolic unweighted edgelist file. It is a simple text file with one edge per line. An edge is defined by two symbolic vertex names separated by whitespace. The symbolic vertex names themselves cannot contain whitespace. -### Output ### -The first output file, with extension .mcliques, lists the extracted maximal cliques, one for each row. Each maximal clique is expressed as a whitespace-separated list of its nodes and ends with a virtual node -1. Prior to be output, each node is converted in a positive integer ranging from 0 to N-1, where N is the number of nodes in the graph. The association between symbolic node names and integers is output in the second file. The second output file, with extension .map, lists for each node its associated integer. +#### Output #### +The first output file, with extension .mcliques, lists the extracted maximal cliques, one for each row. Each maximal clique is expressed as a whitespace-separated list of its nodes and ends with a virtual node -1. Prior to be output, each node is converted in a positive integer ranging from 0 to (N-1), where N is the number of nodes in the graph. The association between symbolic node names and integers is output in the second file. The second output file, with extension .map, lists for each node its associated integer. [1]:http://dl.acm.org/citation.cfm?doid=362342.362367 [2]:http://igraph.sourceforge.net/ [3]:http://sourceforge.net/projects/igraph/files/C%20library/0.6/igraph-0.6.tar.gz/download + +#### An Example #### +An example edgelist file of a fully-connected graph with 4 nodes (with symbolic vertex names `node1`, `node2`, `N3` and `myFourthNode`) is the following: + + node1 node2 + node1 N3 + node1 myFourthNode + node2 N3 + node2 myFourthNode + N3 myFourthNode + +By providing as input the previous edgelist file, the program produces the +following two files. + +File .map: + + node1 0 + node2 1 + N3 2 + myFourthNode 3 + +File .mcliques: + + 0 1 2 3 -1 </pre>Simone MainardiWed, 27 Jun 2012 13:34:56 -0000https://sourceforge.net598f4d1fc159cd7c118fbcf0c16afd07dba0b05dhttps://sourceforge.net/p/cosparallel/wiki/MaximalCliquesListing/<pre>--- v5 +++ v6 @@ -2,8 +2,7 @@ Is there something ready for use? --------------------------------- -Yes. We created a simple c program which uses the Bron-Kerbosh algorithm implementation available in [igraph][2]. **Be sure to have igraph-0.6 or above installed**. Version 0.6 can be downloaded [here][3]. -The sources are available in the file `extras/maximal_cliques.c`. To compile it, `cd` to the directory where you downloaded the sources of **COS**, then `cd` to the `extras` directory and run `make`. This will create the executable `maximal_cliques` in the same folder. +Yes. We created a simple c program which uses the Bron-Kerbosh algorithm implementation available in [igraph][2]. **Be sure to have igraph-0.6 or above installed**, otherwise you can download it from [here][3]. The sources are available in the file `extras/maximal_cliques.c`. To compile it, `cd` to the directory where you downloaded the sources of **COS**, then `cd` to the `extras` directory and run `make`. This will create the executable `maximal_cliques` in the same folder. ### Usage #### @@ -11,7 +10,7 @@ Where: -* <input_edgeslist_file> is a generic symbolic unweighted edgelist file. It is a simple text file with one edge per line. An edge is defined by two symbolic vertex names separated by whitespace. The symbolic vertex names themselves cannot contain whitespace. +* `<input_edgeslist_file>` is a generic symbolic unweighted edgelist file. It is a simple text file with one edge per line. An edge is defined by two symbolic vertex names separated by whitespace. The symbolic vertex names themselves cannot contain whitespace. ### Output ### The first output file, with extension .mcliques, lists the extracted maximal cliques, one for each row. Each maximal clique is expressed as a whitespace-separated list of its nodes and ends with a virtual node -1. Prior to be output, each node is converted in a positive integer ranging from 0 to N-1, where N is the number of nodes in the graph. The association between symbolic node names and integers is output in the second file. The second output file, with extension .map, lists for each node its associated integer. </pre>Simone MainardiWed, 27 Jun 2012 13:28:37 -0000https://sourceforge.net2d7715746882eda415bc6901b61a1dcb389f3265https://sourceforge.net/p/cosparallel/wiki/MaximalCliquesListing/<pre>--- v4 +++ v5 @@ -2,7 +2,8 @@ Is there something ready for use? --------------------------------- -Yes. We created a simple c program which uses the Bron-Kerbosh algorithm implementation available in [igraph][2]. The sources are available in the file `extras/maximal_cliques.c`. To compile it, `cd` to the directory where you downloaded the sources of **COS**, then `cd` to the `extras` directory and run `make`. This will create the executable `maximal_cliques` in the same folder. +Yes. We created a simple c program which uses the Bron-Kerbosh algorithm implementation available in [igraph][2]. **Be sure to have igraph-0.6 or above installed**. Version 0.6 can be downloaded [here][3]. +The sources are available in the file `extras/maximal_cliques.c`. To compile it, `cd` to the directory where you downloaded the sources of **COS**, then `cd` to the `extras` directory and run `make`. This will create the executable `maximal_cliques` in the same folder. ### Usage #### @@ -17,3 +18,4 @@ [1]:http://dl.acm.org/citation.cfm?doid=362342.362367 [2]:http://igraph.sourceforge.net/ +[3]:http://sourceforge.net/projects/igraph/files/C%20library/0.6/igraph-0.6.tar.gz/download </pre>Simone MainardiWed, 27 Jun 2012 13:26:40 -0000https://sourceforge.net224721f8e6a0f22fa4aebb63b7fc1adae1263b4chttps://sourceforge.net/p/cosparallel/wiki/MaximalCliquesListing/<pre>--- v3 +++ v4 @@ -1,7 +1,19 @@ Listing all the maximal cliques of a graph is an old, widely studied problem and a lot of algorithms have been proposed so far. One of the fastest algorithms is the one of [Bron-Kerbosh][1]. Its implementation is freely available in the [igraph][2] C library, *starting from version 0.6*. -We created a simple c program which uses the Bron-Kerbosh algorithm implementation available in [igraph][2]. The sources are available in the file `extras/maximal_cliques.c`. To compile it, `cd` to the directory where you downloaded the sources of **COS**, then `cd` to the `extras` directory and run `make`. +Is there something ready for use? +--------------------------------- +Yes. We created a simple c program which uses the Bron-Kerbosh algorithm implementation available in [igraph][2]. The sources are available in the file `extras/maximal_cliques.c`. To compile it, `cd` to the directory where you downloaded the sources of **COS**, then `cd` to the `extras` directory and run `make`. This will create the executable `maximal_cliques` in the same folder. +### Usage #### + + ./maximal_cliques <input_edgelist_file> + +Where: + +* <input_edgeslist_file> is a generic symbolic unweighted edgelist file. It is a simple text file with one edge per line. An edge is defined by two symbolic vertex names separated by whitespace. The symbolic vertex names themselves cannot contain whitespace. + +### Output ### +The first output file, with extension .mcliques, lists the extracted maximal cliques, one for each row. Each maximal clique is expressed as a whitespace-separated list of its nodes and ends with a virtual node -1. Prior to be output, each node is converted in a positive integer ranging from 0 to N-1, where N is the number of nodes in the graph. The association between symbolic node names and integers is output in the second file. The second output file, with extension .map, lists for each node its associated integer. [1]:http://dl.acm.org/citation.cfm?doid=362342.362367 [2]:http://igraph.sourceforge.net/ </pre>Simone MainardiWed, 27 Jun 2012 13:24:19 -0000https://sourceforge.neta4f550f781184a772e16183278d236e9c719d1afhttps://sourceforge.net/p/cosparallel/wiki/MaximalCliquesListing/<pre>--- v2 +++ v3 @@ -1,8 +1,6 @@ -Listing all the maximal cliques of a graph is an old, widely studied problem and a lot of algorithms have been proposed so far. +Listing all the maximal cliques of a graph is an old, widely studied problem and a lot of algorithms have been proposed so far. One of the fastest algorithms is the one of [Bron-Kerbosh][1]. Its implementation is freely available in the [igraph][2] C library, *starting from version 0.6*. -One of the fastest algorithms is the one of [Bron-Kerbosh][1]. Its implementation is freely available in the [igraph][2] C library, *starting from version 0.6*. - -We created a simple c program which uses the Bron-Kerbosh algorithm implementation available in [igraph][2]. The sources are available in the file `extras/maximal_cliques.c`. To compile it, `cd` into +We created a simple c program which uses the Bron-Kerbosh algorithm implementation available in [igraph][2]. The sources are available in the file `extras/maximal_cliques.c`. To compile it, `cd` to the directory where you downloaded the sources of **COS**, then `cd` to the `extras` directory and run `make`. [1]:http://dl.acm.org/citation.cfm?doid=362342.362367 </pre>Simone MainardiWed, 27 Jun 2012 13:10:33 -0000https://sourceforge.netb0a6bea87e3ea78824555a66a32d75eb4fe0bf16https://sourceforge.net/p/cosparallel/wiki/MaximalCliquesListing/<pre>--- v1 +++ v2 @@ -2,5 +2,8 @@ One of the fastest algorithms is the one of [Bron-Kerbosh][1]. Its implementation is freely available in the [igraph][2] C library, *starting from version 0.6*. +We created a simple c program which uses the Bron-Kerbosh algorithm implementation available in [igraph][2]. The sources are available in the file `extras/maximal_cliques.c`. To compile it, `cd` into + + [1]:http://dl.acm.org/citation.cfm?doid=362342.362367 [2]:http://igraph.sourceforge.net/ </pre>Simone MainardiWed, 27 Jun 2012 13:07:10 -0000https://sourceforge.net647d562b67e2dfa9d417dde13632a8538d56e8a8https://sourceforge.net/p/cosparallel/wiki/MaximalCliquesListing/Listing all the maximal cliques of a graph is an old, widely studied problem and a lot of algorithms have been proposed so far. One of the fastest algorithms is the one of [Bron-Kerbosh][1]. Its implementation is freely available in the [igraph][2] C library, *starting from version 0.6*. [1]:http://dl.acm.org/citation.cfm?doid=362342.362367 [2]:http://igraph.sourceforge.net/ Simone MainardiWed, 27 Jun 2012 12:57:55 -0000https://sourceforge.netd77de84fb1c9d3148862d8a01139a32393e0bac8