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

Author： Yeh H.-G.   Chang G.J.  

Publisher： Elsevier

ISSN： 0304-3975

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

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

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

Hybrid dynamic k-nearest-neighbour and distance and attribute weighted method for classification

By Wu Jia   Cai Zhi-hua   Ao Shuang  

International Journal of Computer Applications in Technology, Vol. 43, Iss. 4, 2012-06 ,pp. : 378-384

Inderscience Publishers

Access to resources Recommend Favorite

PTAS for the minimum weighted dominating set in growth bounded graphs

By Wang Zhong  

Journal of Global Optimization, Vol. 54, Iss. 3, 2012-11 ,pp. : 641-648

Springer Publishing Company

Access to resources Recommend Favorite

Hardness results and approximation algorithms of k-tuple domination in graphs

By Klasing R.   Laforest C.  

Information Processing Letters, Vol. 89, Iss. 2, 2004-01 ,pp. : 75-83

Elsevier

Access to resources Recommend Favorite

Incremental K-clique clustering in dynamic social networks

By Duan Dongsheng  

Artificial Intelligence Review, Vol. 38, Iss. 2, 2012-08 ,pp. : 129-147

Springer Publishing Company

Access to resources Recommend Favorite