Pages that link to "Item:Q3503591"
From MaRDI portal
The following pages link to Exact Algorithms for Edge Domination (Q3503591):
Displaying 16 items.
- Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
- New parameterized algorithms for the edge dominating set problem (Q392035) (← links)
- Exact algorithms for dominating set (Q411862) (← links)
- A refined exact algorithm for edge dominating set (Q477194) (← links)
- Efficiency in exponential time for domination-type problems (Q1003475) (← links)
- Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- Efficient exact algorithms through enumerating maximal independent sets and other techniques (Q2464327) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- Parameterized Edge Dominating Set in Cubic Graphs (Q3004660) (← links)
- Enumerate and Measure: Improving Parameter Budget Management (Q3058690) (← links)
- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs (Q3066473) (← links)
- Exact Algorithms for Edge Domination (Q3503591) (← links)
- The edge domination problem (Q4846685) (← links)
- An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set (Q5321717) (← links)