Pages that link to "Item:Q3452575"
From MaRDI portal
The following pages link to Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575):
Displaying 5 items.
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- (Q5225203) (← links)