Graph::Clique Return all k-cliques in a graph
Download

Graph::Clique Ranking & Summary

Graph::Clique Tags

regular expression Perl module graph clique reduction clique reduction

Graph::Clique Description

Return all k-cliques in a graph Graph::Clique is a Perl module that extends Greg Bacon's implementation on clique reduction with regular expression. Originally can be found at: http://home.hiwaay.net/~gbacon/perl/clique.htmlThe function take clique size (k) and vertices (list of lists) and return all the vertices that form the clique.K-clique problem is known to be NP-complete, so it is advisable to limit the number of edges according to your predefined threshold, rather than exhaustively searching them.SYNOPSIS use Graph::Clique; #Edges in the form of LoL (numerical values required) my @edges = ( , , , , , , , , , , , , , ); my $k = shift || 3; my @cliques = getcliques($k,\@edges); print join("\n", @cliques), "\n"; #Output: #1 2 3 #1 2 4 #1 3 4 #2 3 4 #5 6 9 Requirements: · Perl

Graph::Clique Related Software