Pages that link to "Item:Q2445259"
From MaRDI portal
The following pages link to A linear time algorithm for liar's domination problem in proper interval graphs (Q2445259):
Displaying 13 items.
- Liar's dominating sets in graphs (Q335352) (← links)
- Various bounds for liar's domination number (Q726641) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination (Q2025071) (← 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)
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs (Q2257297) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
- Liar’s Domination in 2D (Q2971650) (← links)
- Total Roman domination for proper interval graphs (Q4958006) (← links)
- (Q5144277) (← links)
