"Hardness results, approximation and exact algorithms for liar's domination ..."

Bhawani Sankar Panda, Subhabrata Paul, Dinabandhu Pradhan (2015)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2015.01.041

access: open

type: Journal Article

metadata version: 2022-01-25

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/PandaPP15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/PandaPP15
Bhawani Sankar Panda, Subhabrata Paul, Dinabandhu Pradhan:
Hardness results, approximation and exact algorithms for liar's domination problem in graphs. Theor. Comput. Sci. 573: 26-42 (2015)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.