Pages that link to "Item:Q6158956"
From MaRDI portal
The following pages link to Algorithmic Aspects of Quasi-Total Roman Domination in Graphs (Q6158956):
Displaying 11 items.
- Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
- Quasi-total Roman domination in graphs (Q2275312) (← links)
- Exact Algorithms for Weak Roman Domination (Q2870018) (← links)
- Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
- Efficient algorithms for independent Roman domination on some classes of graphs (Q6097713) (← links)
- Quasi-total Roman bondage number in graphs (Q6101467) (← links)
- Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489) (← links)
- Quasi-total Roman reinforcement in graphs (Q6110872) (← links)
- (Q6150904) (← links)
- (Q6155858) (← links)
- Quasi total double Roman domination in graphs (Q6643350) (← links)