Pages that link to "Item:Q2257297"
From MaRDI portal
The following pages link to Hardness results, approximation and exact algorithms for liar's domination problem in graphs (Q2257297):
Displaying 11 items.
- Liar's domination in graphs: complexity and algorithm (Q1949115) (← links)
- Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803) (← links)
- On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs (Q2059873) (← links)
- Liar's dominating set problem on unit disk graphs (Q2201773) (← links)
- Liar's domination in unit disk graphs (Q2207495) (← links)
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← 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)
- Liar’s Domination in 2D (Q2971650) (← links)
- (Q5144277) (← links)
- Algorithmic study on liar's vertex-edge domination problem (Q6646745) (← links)