Covering and packing in linear space

DOI10.1016/j.ipl.2011.08.002zbMath1260.05155OpenAlexW1981360277MaRDI QIDQ1944195

Thore Husfeldt, Andreas Björklund, Petteri Kaski, Mikko Koivisto

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.08.002

zbMATH Keywords

chromatic polynomialzeta transform

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Computing generalized convolutions faster than brute force ⋮ Inclusion/exclusion meets measure and conquer

Cites Work

• On the minimum feedback vertex set problem: Exact and enumeration algorithms
• Fourier meets M\"{o}bius: fast subset convolution
• Set Partitioning via Inclusion-Exclusion
• Covering and Packing in Linear Space
• Computational aspects of the Mobius transformation of graphs
• Combinatorial bounds via measure and conquer
• On Independent Sets and Bicliques in Graphs
• Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
• On cliques in graphs

This page was built for publication: Covering and packing in linear space