Pages that link to "Item:Q2053214"
From MaRDI portal
The following pages link to Double vertex-edge domination in graphs: complexity and algorithms (Q2053214):
Displaying 10 items.
- An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators (Q1847358) (← links)
- Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q2111523) (← links)
- (Q4784333) (← links)
- (Q5037236) (← links)
- Total vertex-edge domination in graphs: Complexity and algorithms (Q5057738) (← links)
- (Q6110134) (← links)
- On \(k\)-vertex-edge domination of graph (Q6146665) (← links)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q6167020) (← links)
- Algorithmic study on liar's vertex-edge domination problem (Q6646745) (← links)