On the Grundy and b-Chromatic Numbers of a Graph

ISSN： 0178-4617

Source： Algorithmica, Vol.65, Iss.4, 2013-04, pp. : 885-899

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

Related content

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

New Results on the Queens_n² Graph Coloring Problem

By Vasquez Michel

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

Springer Publishing Company

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

The p-sized partitioning algorithm for fast computation of factorials of numbers

By Ugur Ahmet Thompson Henry

The Journal of Supercomputing, Vol. 38, Iss. 1, 2006-10 ,pp. : 73-82

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Solution of A, x ^(k) = b ^(k) Using A ⁻¹

By Ditkowski Adi Fibich Gadi Gavish Nir

Journal of Scientific Computing, Vol. 32, Iss. 1, 2007-07 ,pp. : 29-44

Springer Publishing Company

Access to resources Recommend Favorite