Pages that link to "Item:Q2283034"
From MaRDI portal
The following pages link to Algorithmic aspects of upper paired-domination in graphs (Q2283034):
Displaying 9 items.
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- Paired Domination in Graphs (Q3384606) (← links)
- Upper paired domination versus upper domination (Q5024681) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)