Pages that link to "Item:Q2458924"
From MaRDI portal
The following pages link to A note on the complexity of minimum dominating set (Q2458924):
Displaying 18 items.
- Exact algorithms for dominating set (Q411862) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Finding a dominating set on bipartite graphs (Q963425) (← links)
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- A randomized algorithm for determining dominating sets in graphs of maximum degree five (Q1034633) (← links)
- Pathwidth of cubic graphs and exact algorithms (Q1045933) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Exact algorithms for maximum induced matching (Q2407101) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- An exact algorithm for the minimum dominating clique problem (Q2456374) (← links)
- Membrane computing to enhance time efficiency of minimum dominating set (Q2630783) (← links)
- Improved worst-case complexity for the MIN 3-SET COVERING problem (Q2643796) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- (Q5136272) (← links)
