Pages that link to "Item:Q5002958"
From MaRDI portal
The following pages link to Algorithmic Aspects of Some Variants of Domination in Graphs (Q5002958):
Displaying 12 items.
- Independent dominating set problem revisited (Q476836) (← links)
- More results on the complexity of domination problems in graphs (Q1664084) (← links)
- Algorithmic aspect of \(k\)-tuple domination in graphs. (Q1860929) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← links)
- (Q3374248) (← links)
- (Q4982374) (← links)
- (Q5104253) (← links)
- Algorithmic aspects of total k-subdomination in graphs (Q5492681) (← links)
- Fundamentals of Computation Theory (Q5492926) (← links)
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs (Q5864729) (← links)
- Complexity and algorithms for semipaired domination in graphs (Q5918285) (← links)