An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs

By Hsieh Sun-Yuan  

The Journal of Supercomputing, Vol. 39, Iss. 1, 2007-01 ,pp. : 39-57

Springer Publishing Company

Access to resources Recommend Favorite

Structuring the elementary components of graphs having a perfect internal matching

By Bartha M.   Kresz M.  

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 179-210

Elsevier

Access to resources Recommend Favorite

Combinatorics of perfect matchings in plane bipartite graphs and application to tilings

By Fournier J.C.  

Theoretical Computer Science, Vol. 303, Iss. 2, 2003-07 ,pp. : 333-351

Elsevier

Access to resources Recommend Favorite

Forced color classes, intersection graphs and the strong perfect graph conjecture

By Sakuma T.  

Theoretical Computer Science, Vol. 235, Iss. 2, 2000-03 ,pp. : 309-324

Elsevier

Access to resources Recommend Favorite

Parallel robots perfect propellors

By Kochan Anna  

Industrial Robot: An International Journal, Vol. 23, Iss. 4, 1996-04 ,pp. : 27-30

Emerald Group Publishing Ltd

Access to resources Recommend Favorite