Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search

Author： Cáceres E. N.   Song S. W.   Szwarcfiter J. L.  

Publisher： Edp Sciences

E-ISSN： 1290-385x|44|3|293-311

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.44, Iss.3, 2010-10, pp. : 293-311

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

Clique partitioning of interval graphs with submodular costs on the cliques

By Gijswijt Dion   Jost Vincent   Queyranne Maurice  

RAIRO - Operations Research, Vol. 41, Iss. 3, 2007-08 ,pp. : 275-287

Edp Sciences

Access to resources Recommend Favorite

Parallel Evolutionary Optimization Algorithms for Peptide-Protein Docking

By  

EPJ Web of Conference, Vol. 173, Iss. issue, 2018-02 ,pp. : 06010-06010

Edp Sciences

Access to resources Recommend Favorite

Genetic and Tabu search algorithms for peptide assembly problem

By Błażewicz Jacek   Borowski Marcin   Formanowicz Piotr   Głowacki Tomasz  

RAIRO - Operations Research, Vol. 44, Iss. 2, 2010-04 ,pp. : 153-166

Edp Sciences

Access to resources Recommend Favorite

The Circle

By Quammen David  

EcoHealth, Vol. 10, Iss. 4, 2013-12 ,pp. : 492-493

Springer Publishing Company

Access to resources Recommend Favorite

Minimum convex-cost tension problems on series-parallel graphs

By Bachelet Bruno   Mahey Philippe  

RAIRO - Operations Research, Vol. 37, Iss. 4, 2010-03 ,pp. : 221-234

Edp Sciences

Access to resources Recommend Favorite