Hardness results and approximation algorithm for total liar's domination in graphs

B. S. Panda, S. Paul. Hardness results and approximation algorithm for total liar's domination in graphs. J. Comb. Optim., 27(4):643-662, 2014. [doi]

No reviews for this publication, yet.