Pages that link to "Item:Q3499732"

The following pages link to edge dominating set: Efficient Enumeration-Based Exact Algorithms (Q3499732):

Displaying 37 items.

• Kernelization of edge perfect code and its variants (Q317422) (← links)
• Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
• New parameterized algorithms for the edge dominating set problem (Q392035) (← links)
• Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover (Q456689) (← links)
• A refined exact algorithm for edge dominating set (Q477194) (← links)
• Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
• Multistage graph problems on a global budget (Q831134) (← links)
• Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
• Fixed-parameter enumerability of cluster editing and related problems (Q970105) (← links)
• Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
• On two techniques of combining branching and treewidth (Q1022343) (← links)
• Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
• Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
• On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
• On directed covering and domination problems (Q1735678) (← links)
• Maximum matching and kernelization of edge dominating set (Q1751411) (← links)
• Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
• Exact algorithms for edge domination (Q1945174) (← links)
• Improved parameterized algorithms and kernels for mixed domination (Q2310753) (← links)
• New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
• A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
• Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
• Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications (Q2942439) (← links)
• Parameterized Edge Dominating Set in Cubic Graphs (Q3004660) (← links)
• Domination When the Stars Are Out (Q3012826) (← links)
• Enumerate and Measure: Improving Parameter Budget Management (Q3058690) (← links)
• Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs (Q3066473) (← links)
• New Parameterized Algorithms for the Edge Dominating Set Problem (Q3088075) (← links)
• Exact Algorithms for Edge Domination (Q3503591) (← links)
• Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
• New Results on Directed Edge Dominating Set (Q5005171) (← links)
• (Q5090486) (← links)
• On Directed Covering and Domination Problems (Q5136265) (← links)
• An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set (Q5321717) (← links)
• On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
• Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
• Space limited linear-time graph algorithms on big data (Q6196840) (← links)