Add clique detection algorithms DFMax, Bron-Kerbosch

[wegner]

C++ sources are already available at
ftp://dimacs.rutgers.edu/pub/challenge/graph/solvers/

@ARTICLE{bk73,
  author = {C. Bron and J. Kerbosch},
  title = {{F}inding all cliques of an undirected graph},
  journal = {Communications of the ACM},
  year = {1973},
  volume = {16},
  pages = {575--577},
  owner = {wegner@users.sf.net},
  groupsearch = {0},
  url = {http://www.netlib.org/tomspdf/457.pdf},
}

@MISC{aj88,
  author = {D. Applegate and D. S. Johnson},
  title = {dfmax.c [{C} program, {O}nline], available at 
ftp://dimacs.rutgers.edu/pub/challenge/graph/solvers},
  year = {1988},
  owner = {wegner@users.sf.net},
  url = 
{ftp://dimacs.rutgers.edu/pub/challenge/graph/solvers/dfmax.
c},
}

[wegner]

Logged In: YES 
user_id=169818

see also GPL sources at
http://www.python.net/crew/dalke/clique/

[Andrew Sutton]

I had proposed to implement this as part of my SoC proposal, so I'm reassigning this to myself.

[Jeremiah Willcock]

Is this task done now? It appears so.

[Andrew Sutton]

The algorithm is in trunk, but has not been prepped for release. This is part of the suite of commits from SoC 2007. We can probably close this.

[Jeremiah Willcock]

Closed as requested by last comment.