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

ISSN： 0920-8542

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

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

Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs

By Yeh H.-G. Chang G.J.

Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. : 3-8

Elsevier

Access to resources Recommend Favorite

Efficient minus and signed domination in graphs

By Lu C.L. Peng S. Tang C.Y.

Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. : 381-397

Elsevier

Access to resources Recommend Favorite

A simple paradigm for graph recognition: application to cographs and distance hereditary graphs

By Damiand G. Habib M. Paul C.

Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. : 99-111

Elsevier

Access to resources Recommend Favorite

Efficient parallel algorithms for doubly convex-bipartite graphs

By Chang-Wu Y. Gen-Huey C.

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 249-265

Elsevier

Access to resources Recommend Favorite

Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic Algorithm

By Kwok Y-K. Ahmad I.

Journal of Parallel and Distributed Computing, Vol. 47, Iss. 1, 1997-11 ,pp. : 58-77

Academic Press

Access to resources Recommend Favorite