The following pages link to Dina Pradhan (Q1730019):
Displaying 6 items.
- (Q1702840) (redirect page) (← links)
- On computing a minimum secure dominating set in block graphs (Q1702842) (← links)
- The secure domination problem in cographs (Q1730021) (← links)
- An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph (Q2053252) (← links)
- Algorithm and hardness results on neighborhood total domination in graphs (Q2201995) (← links)
- The strong domination problem in block graphs and proper interval graphs (Q5207497) (← links)
