Pages that link to "Item:Q1026225"

The following pages link to Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225):

Displaying 22 items.

• The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721) (← links)
• On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
• Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover (Q714786) (← links)
• Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296) (← links)
• Some observations on holographic algorithms (Q1616615) (← links)
• On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
• The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
• Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
• An efficient heuristic algorithm for solving connected vertex cover problem (Q1720833) (← links)
• Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
• Metabolic networks are NP-hard to reconstruct (Q1797721) (← links)
• Extension and its price for the connected vertex cover problem (Q2072064) (← links)
• Parameterized complexity of multi-node hubs (Q2084737) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• Nonseparating independent sets of Cartesian product graphs (Q2300678) (← links)
• Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
• The connected vertex cover problem in \(k\)-regular graphs (Q2424831) (← links)
• On complementary coverage of \({\Omega}_n(T)\) (Q2437354) (← links)
• Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
• On Complexity of Total Vertex Cover on Subcubic Graphs (Q2988847) (← links)
• Enumerate and Measure: Improving Parameter Budget Management (Q3058690) (← links)
• Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)