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 29 items.
- Exact algorithms for dominating set (Q411862) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← 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)
- On finding a minimum dominating set in a tournament (Q1113678) (← links)
- The algorithmic complexity of minus domination in graphs (Q1917346) (← links)
- A heuristic approximation algorithm of minimum dominating set based on rough set theory (Q2168768) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- On the complexity of Mixed Dominating Set (Q2330564) (← 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)
- Exponential time algorithms for the minimum dominating set problem on some graph classes (Q2930282) (← links)
- (Q3104317) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
- Combinatorial bounds via measure and conquer (Q4962767) (← links)
- Improved bounds for online dominating sets of trees (Q5136272) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710806) (← links)