Pages that link to "Item:Q1630923"

The following pages link to An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923):

Displaying 8 items.

• A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946) (← links)
• A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
• A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583) (← links)
• Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
• A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem (Q1944113) (← links)
• Graph-based semi-supervised one class support vector machine for detecting abnormal lung sounds (Q2284044) (← links)
• 3-path vertex cover and dissociation number of hexagonal graphs (Q5866250) (← links)
• Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)