Hardness results, approximation and exact algorithms for liar's domination problem in graphs

Bhawani Sankar Panda, S. Paul, D. Pradhan. Hardness results, approximation and exact algorithms for liar's domination problem in graphs. Theoretical Computer Science, 573:26-42, 2015. [doi]

Abstract

Abstract is missing.