Pages that link to "Item:Q2895354"
From MaRDI portal
The following pages link to The algorithmic complexity of domination digraphs (Q2895354):
Displaying 6 items.
- A decidability result for the dominating set problem (Q410736) (← links)
- More results on the complexity of domination problems in graphs (Q1664084) (← links)
- The algorithmic complexity of minus domination in graphs (Q1917346) (← links)
- The upper domatic number of a graph (Q5154570) (← links)
- Fundamentals of Computation Theory (Q5492926) (← links)
- Complexity and algorithms for semipaired domination in graphs (Q5918285) (← links)