A Novel Evolutionary Formulation of the Maximum Independent Set Problem

Author： Barbosa Valmir C. Campos Luciana C. D.

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.8, Iss.4, 2004-12, pp. : 419-437

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

Maximum weight k -independent set problem on permutation graphs

By Saha A. Pal M.

International Journal of Computer Mathematics, Vol. 80, Iss. 12, 2003-12 ,pp. : 1477-1487

Taylor & Francis Ltd

Access to resources Recommend Favorite

An Algorithm for the Maximum Likelihood Problem on Evolutionary Trees

By Oliveira Carlos

Journal of Combinatorial Optimization, Vol. 10, Iss. 1, 2005-08 ,pp. : 61-75

Springer Publishing Company

Access to resources Recommend Favorite

The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set

By Lau H.Y. Ting H.F.

Journal of Combinatorial Optimization, Vol. 5, Iss. 4, 2001-12 ,pp. : 411-420

Springer Publishing Company

Access to resources Recommend Favorite

A compact linear programming formulation of the maximum concurrent flow problem

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 1, 2015-01 ,pp. : 68-87

John Wiley & Sons Inc

Access to resources Recommend Favorite

Two Novel Evolutionary Formulations of the Graph Coloring Problem

By Barbosa Valmir C. Assis Carlos A.G. Do Nascimento Josina O.

Journal of Combinatorial Optimization, Vol. 8, Iss. 1, 2004-03 ,pp. : 41-63

Springer Publishing Company

Access to resources Recommend Favorite