Pages that link to "Item:Q507444"

The following pages link to Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444):

Displaying 27 items.

• Approximate association via dissociation (Q505447) (← links)
• On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← 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)
• 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)
• Relating dissociation, independence, and matchings (Q2081478) (← 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 minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
• The geodesic-transversal problem (Q2246468) (← links)
• Parameterized algorithm for 3-path vertex cover (Q2317858) (← links)
• Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
• New Results on Directed Edge Dominating Set (Q5005171) (← links)
• (Q5092393) (← links)
• A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
• The maximum number of maximum dissociation sets in trees (Q6055404) (← links)
• The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)
• Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
• Maximum weight <i>t</i>-sparse set problem on vector-weighted graphs (Q6140983) (← links)
• Maximum dissociation sets in subcubic trees (Q6176408) (← links)
• On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number (Q6178795) (← links)
• On the maximum number of maximum dissociation sets in trees with given dissociation number (Q6204327) (← links)
• On kernels for \(d\)-path vertex cover (Q6564612) (← links)
• Enumerating maximal dissociation sets in three classes of grid graphs (Q6585552) (← links)
• Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs (Q6620013) (← links)