The study of k-tuple domination problem in special graphs was presented. The complexity of the domination problem was analyzed by using the hardness results and approximation algorithms. In this regard, a linear-time algorithm for the 2-tuple domination problem in trees and in strongly chordal graphs was devised. The obtained approximation algorithm was a polynomial time algorithm whose output solution was compared with the optimal solution.
机构:
Univ Johannesburg, Dept Math & Appl Math, ZA-2006 Auckland Pk, South AfricaUniv Johannesburg, Dept Math & Appl Math, ZA-2006 Auckland Pk, South Africa
Henning, Michael A.
Kazemi, Adel P.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Mohaghegh Ardabili, Dept Math, POB 5619911367, Ardebil, IranUniv Johannesburg, Dept Math & Appl Math, ZA-2006 Auckland Pk, South Africa
机构:
Shanghai Univ, Dept Math, Shanghai 200444, Peoples R ChinaShanghai Univ, Dept Math, Shanghai 200444, Peoples R China
Xu, Guangjun
Kang, Liying
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Univ, Dept Math, Shanghai 200444, Peoples R ChinaShanghai Univ, Dept Math, Shanghai 200444, Peoples R China
Kang, Liying
Shan, Erfang
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China
Hong Kong Polytech Univ, Dept Logist, Kowloon, Hong Kong, Peoples R ChinaShanghai Univ, Dept Math, Shanghai 200444, Peoples R China
Shan, Erfang
Yan, Hong
论文数: 0引用数: 0
h-index: 0
机构:
Hong Kong Polytech Univ, Dept Logist, Kowloon, Hong Kong, Peoples R ChinaShanghai Univ, Dept Math, Shanghai 200444, Peoples R China