Rank: 12638 based on 0 downloads (last 30 days) and 0 files submitted

Henry Wolkowicz

E-mail: Contact Author

Personal Profile:
Professional Interests:

Watch this Author's files

Files
Watch Lists

Comments and Ratings by Henry		1 - 1 of 1
Updated	File	Comments	Rating
02 Dec 2008	Maximal Cliques Finds all the maximal complete sub-graphs (maximal cliques) in a graph Author: Ahmad	I have only tested the file a few times. It works well, but there should be a warning that it slows down quickly, i.e. 40 nodes can already be too much. Of course, finding all the cliques is an NP-hard problem so that is not a surprise. But, ... a warning would help.

Currently Watching
Type	Description
File	Maximal Cliques

Files Matching Henry's Watch List					1 - 1 of 1
Updated		File	Tags	Downloads (last 30 days)	Comments	Rating
31 May 2010		Maximal Cliques Finds all the maximal complete sub-graphs (maximal cliques) in a graph Author: Ahmad	complete subgraph, clique, rectangular, square, graph	18	2	3.5 3.5 \| 2 ratings

Comments and Ratings Matching Henry's Watch List			1-3 of 3
Date	File	Comment by	Comments	Rating
26 Apr 2009	Maximal Cliques Finds all the maximal complete sub-graphs (maximal cliques) in a graph	Yonit Marcus		5
07 Dec 2008	Maximal Cliques Finds all the maximal complete sub-graphs (maximal cliques) in a graph	Ahmad	@Henry Warning added and the no. of nodes can be set by WARNING_CONNECTING_NODES_LENGTH .... which defaults to 20. I have done this since an NP-hard problem's actual computability would vary from machine to machine	Comment only
02 Dec 2008	Maximal Cliques Finds all the maximal complete sub-graphs (maximal cliques) in a graph	Henry Wolkowicz	I have only tested the file a few times. It works well, but there should be a warning that it slows down quickly, i.e. 40 nodes can already be too much. Of course, finding all the cliques is an NP-hard problem so that is not a surprise. But, ... a warning would help.	2

Contact us at files@mathworks.com