Pages that link to "Item:Q868040"
From MaRDI portal
The following pages link to An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs (Q868040):
Displayed 7 items.
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334) (← links)
- (Q4691777) (← links)
- (Q5225203) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)