Pages that link to "Item:Q1997258"
From MaRDI portal
The following pages link to On the complexity of the upper \(r\)-tolerant edge cover problem (Q1997258):
Displaying 4 items.
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)