A parallel algorithm that enumerates all the cliques in an undirected graph.
Bavan, A. S. (2008) A parallel algorithm that enumerates all the cliques in an undirected graph. In: Advances in computer and information sciences and engineering. Sobh., Tarek , ed. Springer, Dordrecht. ISBN 9781402087400
Full text is not in this repository.
|Item Type:||Book Section|
|Research Areas:||School of Science and Technology > Computer and Communications Engineering|
|Deposited On:||14 May 2009 15:45|
|Last Modified:||06 Feb 2013 11:40|
Repository staff and depositor only: item control page
Full text downloads (NB count will be zero if no full text documents are attached to the record)
Downloads per month over the past year