Jump to content

Talk:Bron–Kerbosch algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SmackBot (talk | contribs) at 02:29, 12 October 2010 (Subst: {{unsigned}} (& regularise templates)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

This renders wrong in ie7. I'm guessing there are union and intersection etc. symbols but they all look like boxes. —Preceding unsigned comment added by 192.91.147.34 (talkcontribs)

It does contain set notation. You may find Help:Special characters#Displaying Special Characters to be helpful. —David Eppstein (talk) 04:43, 9 June 2010 (UTC)[reply]

The pseudo-code in Cazals and Karande's paper (TCS, 2008, (407):564-568) worked better for me than the one presented in this page! The example contains a couple of typos. Michele Zito, 4 July 2010. —Preceding undated comment added 20:02, 4 July 2010 (UTC).[reply]

You're welcome to fix them.David Eppstein (talk) 20:15, 4 July 2010 (UTC)[reply]
I may be wrong but, in the example, when v=6 (third iteration for u=2) the recursive call should be BronKerbosch2({6},{4},Ø), rather than BronKerbosch2({6},Ø,{4})? Michele Zito, 19 July 2010.
Vertex 4 is moved into X during the iteration v=4, so that's why it's still in X during the iteration v=6. —David Eppstein (talk) 14:20, 19 July 2010 (UTC)[reply]
ok, but then the last sentence in the third paragraph of the example should read "Then, vertex 4 is added to X and removed from P". Michele Zito, 19 July 2010. —Preceding undated comment added 14:45, 19 July 2010 (UTC).[reply]
Good catch. Fixed. —David Eppstein (talk) 15:07, 19 July 2010 (UTC)[reply]