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):

Displayed 4 items.

• 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)
• Analyzing the 3-path vertex cover problem in planar bipartite graphs (Q6111949) ‎ (← links)