Pages that link to "Item:Q2181241"
From MaRDI portal
The following pages link to Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241):
Displayed 7 items.
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- An improved exact algorithm for minimum dominating set in chordal graphs (Q2059888) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- (Q5027688) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925558) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
- Recognizing well-dominated graphs is coNP-complete (Q6072202) (← links)