Pages that link to "Item:Q2444740"

The following pages link to The vertex cover \(P_3\) problem in cubic graphs (Q2444740):

Displaying 23 items.

• Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
• Kernelization of the 3-path vertex cover problem (Q279214) (← links)
• On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619) (← links)
• PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
• A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
• An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
• PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
• Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
• Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
• Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
• Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
• The geodesic-transversal problem (Q2246468) (← links)
• Algorithm for online 3-path vertex cover (Q2300630) (← links)
• Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
• The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← links)
• Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (Q2437764) (← 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>₄problem in cubic graphs (Q2931950) (← links)
• Approximation Algorithm for the Minimum Connected $$k$$-Path Vertex Cover Problem (Q2942448) (← links)
• Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
• Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
• 3-path vertex cover and dissociation number of hexagonal graphs (Q5866250) (← links)
• The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)