Pages that link to "Item:Q3639274"
From MaRDI portal
The following pages link to Inclusion/Exclusion Meets Measure and Conquer (Q3639274):
Displaying 25 items.
- Exact algorithms for dominating set (Q411862) (← links)
- A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281) (← links)
- Bicolored independent sets and bicliques (Q436317) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- An exact algorithm for connected red-blue dominating set (Q635737) (← links)
- On partitioning a graph into two connected subgraphs (Q650911) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees (Q2223687) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- A Faster Algorithm for Dominating Set Analyzed by the Potential Method (Q2891336) (← links)
- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching (Q3057615) (← links)
- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting (Q3058704) (← links)
- Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
- Simplifying Inclusion–Exclusion Formulas (Q5364235) (← links)
- Limiting the search in brute force method for subsets detection (Q6588759) (← links)
