Pages that link to "Item:Q650941"
From MaRDI portal
The following pages link to On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941):
Displayed 6 items.
- On the weighted \(k\)-path vertex cover problem (Q406316) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- The vertex cover \(P_3\) problem in cubic graphs (Q2444740) (← links)
- On the vertex \(k\)-path cover (Q2446837) (← links)
- Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem (Q2447765) (← links)
- A 2-approximation algorithm for the vertex cover<i>P</i><sub>4</sub>problem in cubic graphs (Q2931950) (← links)