Pages that link to "Item:Q2015803"
From MaRDI portal
The following pages link to Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803):
Displaying 8 items.
- Various bounds for liar's domination number (Q726641) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- Liar's domination in graphs: complexity and algorithm (Q1949115) (← links)
- Liar's domination in unit disk graphs (Q2207495) (← links)
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs (Q2257297) (← links)
- A linear time algorithm for liar's domination problem in proper interval graphs (Q2445259) (← links)
- Connected liar's domination in graphs: complexity and algorithms (Q2874035) (← links)
- On the total liar's domination of graphs (Q6101487) (← links)