Inclusion/exclusion meets measure and conquer (Q2249747): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Implicit branching and parameterized partial cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Subgraphs via Homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion and exclusion algorithm for the Hamiltonian path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerate and Measure: Improving Parameter Budget Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for exact satisfiability and number of perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Paths and Packings in Halves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trimmed Moebius inversion and graphs of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and packing in linear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for dominating clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for min independent dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for max independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved parameterized set splitting algorithms: A Probabilistic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Problems as Hard as CNF-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2006: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial problem. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum leaf spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum feedback vertex set problem: Exact and enumeration algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two techniques of combining branching and treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving connected dominating set faster than \(2^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure & conquer approach for the analysis of exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bounds via measure and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential algorithms for partial cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent sets and bicliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential time algorithms for the minimum dominating set problem on some graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of minimum dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for Dominating Set Analyzed by the Potential Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming meets the principle of inclusion and exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial vs. Complete Domination: t-Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits and Applications of Group Algebras for Parameterized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even Faster Algorithm for Set Splitting! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partitioning a graph into two connected subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds and algorithms for hypergraph 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved exact algorithm for the domatic number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency in exponential time for domination-type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for edge domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion/Exclusion Meets Measure and Conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximations for max set splitting and max NAE SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outward rotations / rank
 
Normal rank

Latest revision as of 16:52, 8 July 2024

scientific article
Language Label Description Also known as
English
Inclusion/exclusion meets measure and conquer
scientific article

    Statements

    Inclusion/exclusion meets measure and conquer (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 July 2014
    0 references
    exact exponential algorithm
    0 references
    dominating set
    0 references
    NP-hard
    0 references
    branching
    0 references
    inclusion/exclusion
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers