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):
Displaying 50 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 weighted \(k\)-path vertex cover problem (Q406316) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← 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)
- Efficient algorithm for the vertex cover \(P_k\) problem on cacti (Q1739987) (← links)
- Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
- Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem (Q2008933) (← links)
- Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
- On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← links)
- Relating dissociation, independence, and matchings (Q2081478) (← links)
- On partial descriptions of König graphs for odd paths and all their spanning supergraphs (Q2115309) (← links)
- Approximation algorithms for hitting subgraphs (Q2115875) (← links)
- Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (Q2129757) (← links)
- Maximal and maximum dissociation sets in general and triangle-free graphs (Q2141169) (← links)
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
- Approximation algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
- The geodesic-transversal problem (Q2246468) (← links)
- Algorithm for online 3-path vertex cover (Q2300630) (← links)
- Parameterized algorithm for 3-path vertex cover (Q2317858) (← links)
- The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs (Q2333163) (← links)
- The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← links)
- On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093) (← 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)
- Approximation Algorithm for the Minimum Connected $$k$$-Path Vertex Cover Problem (Q2942448) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407) (← links)
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
- Uniformly dissociated graphs (Q4604516) (← links)
- (Q4691867) (← links)
- (Q4691905) (← links)
- (Q4691914) (← links)
- König Graphs with Respect to the 4-Path and Its Spanning Supergraphs (Q4973244) (← links)
- General d-position sets (Q5013341) (← links)
- On the König graphs for a 5-path and its spanning supergraphs (Q5090154) (← links)
- (Q5225203) (← 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)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
