Boost :

Date view	Thread view	Subject view	Author view

From: Phlip (pplumlee_at_[hidden])
Date: 2001-03-04 02:10:26

Next message: aijaz ahmed: "an invitation"
Previous message: Reid Sweatman: "RE: [boost] Re: circular_buffer?"
In reply to: Jeremy Siek: "Re: [boost] BGL: problem in adjacency_list<>::clear()"
Next in thread: Doug Gregor: "Re: [boost] BGL: max clique?"
Reply: Doug Gregor: "Re: [boost] BGL: max clique?"

Boosters:

Does Boost Graph Library have any algorithms to locate the maximum clique in
a graph?

(A clique is a sub-graph in which every node links to every other node.)

If not, how would one approach this problem?

-- 
  Phlip                          phlip_cpp_at_[hidden]
============== http://phlip.webjump.com ==============
  --  Personally qualified to snub Mensa  --

Next message: aijaz ahmed: "an invitation"
Previous message: Reid Sweatman: "RE: [boost] Re: circular_buffer?"
In reply to: Jeremy Siek: "Re: [boost] BGL: problem in adjacency_list<>::clear()"
Next in thread: Doug Gregor: "Re: [boost] BGL: max clique?"
Reply: Doug Gregor: "Re: [boost] BGL: max clique?"

Date view	Thread view	Subject view	Author view

Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk