Parallel algorithms for finding cliques in a graph

Publisher： IOP Publishing

ISSN： 1742-6596

Source： Journal of Physics: Conference Series , Vol.268, Iss.1, 2011-01, pp. : 403-423

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Coupling graph perturbation theory with scalable parallel algorithms for large-scale enumeration of maximal cliques in biological graphs

By  

Journal of Physics: Conference Series , Vol. 125, Iss. 1, 2008-07 ,pp. : 460-465

IOP Publishing

Access to resources Recommend Favorite

Graph Extremities Defined by Search Algorithms

By Berry Anne   Blair Jean R.S.   Bordat Jean-Paul   Simonet Geneviève  

Algorithms, Vol. 3, Iss. 2, 2010-03 ,pp. : 100-124

MDPI

Access to resources Recommend Favorite

Editorial: Special Issue on Graph Algorithms

By Jansson Jesper  

Algorithms, Vol. 6, Iss. 3, 2013-08 ,pp. : 457-458

MDPI

Access to resources Recommend Favorite

New algorithms for parallel MRI

By  

Journal of Physics: Conference Series , Vol. 135, Iss. 1, 2008-11 ,pp. : 75-82

IOP Publishing

Access to resources Recommend Favorite

Internal Diffusion-Limited Aggregation: Parallel Algorithms and Complexity

By Moore C.   Machta J.  

Journal of Statistical Physics, Vol. 99, Iss. 3-4, 2000-05 ,pp. : 661-690

Springer Publishing Company

Access to resources Recommend Favorite