Pages that link to "Item:Q1003475"
From MaRDI portal
The following pages link to Efficiency in exponential time for domination-type problems (Q1003475):
Displaying 7 items.
- Exact algorithms for dominating set (Q411862) (← links)
- A refined exact algorithm for edge dominating set (Q477194) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- (Q5136272) (← links)
