New Results on the Queens_n² Graph Coloring Problem

ISSN： 1381-1231

Source： Journal of Heuristics, Vol.10, Iss.4, 2004-07, pp. : 407-413

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

A hierarchical parallel genetic approach for the graph coloring problem

By Abbasian Reza Mouhoub Malek

Applied Intelligence, Vol. 39, Iss. 3, 2013-10 ,pp. : 510-528

Springer Publishing Company

Access to resources Recommend Favorite

Augmenting the Rigidity of a Graph in R ²

By García A. Tejel J.

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 145-168

Springer Publishing Company

Access to resources Recommend Favorite

A NEW APPROACH TO THE VERTEX COLORING PROBLEM

By Torkestani Javad Akbari

Cybernetics and Systems, Vol. 44, Iss. 5, 2013-07 ,pp. : 444-466

Taylor & Francis Ltd

Access to resources Recommend Favorite

Development of neurofuzzy architecture for solving the N -Queens problem

By da Silva Ivan Nunes Ulson Jose Alfredo de Souza Andre Nunes

International Journal of General Systems, Vol. 34, Iss. 6, 2005-12 ,pp. : 717-734

Taylor & Francis Ltd

Access to resources Recommend Favorite

Finding a Minimum-depth Embedding of a Planar Graph in O(n ⁴) Time

By Angelini Patrizio Battista Giuseppe Patrignani Maurizio

Algorithmica, Vol. 60, Iss. 4, 2011-08 ,pp. : 890-937

Springer Publishing Company

Access to resources Recommend Favorite