Pages that link to "Item:Q1945174"
From MaRDI portal
The following pages link to Exact algorithms for edge domination (Q1945174):
Displayed 10 items.
- A refined exact algorithm for edge dominating set (Q477194) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Inexact graph matching using a hierarchy of matching processes (Q2288126) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Exact algorithms for dominating induced matching based on graph partition (Q2352792) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Exact algorithms for maximum induced matching (Q2407101) (← links)
- The Multi-parameterized Cluster Editing Problem (Q2867127) (← links)
- (Q5090486) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)