Opened 12 years ago

Closed 10 years ago

#693 closed Feature Requests (fixed)

Add clique detection algorithms DFMax, Bron-Kerbosch

Reported by: wegner Owned by: Andrew Sutton
Milestone: Component: graph
Version: None Severity: Not Applicable
Keywords: Cc:

Description

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},
}

Change History (6)

comment:1 Changed 12 years ago by wegner

Logged In: YES 
user_id=169818

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

comment:2 Changed 11 years ago by Andrew Sutton

Owner: changed from jsiek to Andrew Sutton
Severity: Not Applicable
Status: assignednew

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

comment:3 Changed 11 years ago by Andrew Sutton

Status: newassigned

comment:4 Changed 10 years ago by Jeremiah Willcock

Is this task done now? It appears so.

comment:5 Changed 10 years ago by 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.

comment:6 Changed 10 years ago by Jeremiah Willcock

Resolution: Nonefixed
Status: assignedclosed

Closed as requested by last comment.

Note: See TracTickets for help on using tickets.