An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs

By Bhattacharya B.K.   Kaller D.  

Journal of Algorithms, Vol. 25, Iss. 2, 1997-11 ,pp. : 336-358

Academic Press

Access to resources Recommend Favorite

Surface capacity of gears of circular-arc tooth-profile

By El-Bahloul A.M.M.  

Wear, Vol. 193, Iss. 2, 1996-05 ,pp. : 146-154

Elsevier

Access to resources Recommend Favorite

A (2 + ɛ)-Approximation Scheme for Minimum Domination on Circle Graphs

By Damian-Iordache M.   Pemmaraju S.V.  

Journal of Algorithms, Vol. 42, Iss. 2, 2002-02 ,pp. : 255-276

Academic Press

Access to resources Recommend Favorite

On Circular Flows Of Graphs

By Lai Hong-Jian  

Combinatorica, Vol. 27, Iss. 2, 2007-03 ,pp. : 245-246

Springer Publishing Company

Access to resources Recommend Favorite

Perfect Circular Arc Coloring

By Chen Xujin   Hu Zhiquan   Zang Wenan  

Journal of Combinatorial Optimization, Vol. 9, Iss. 3, 2005-05 ,pp. : 267-280

Springer Publishing Company

Access to resources Recommend Favorite