Kernels for Edge Dominating Set: Simpler or Smaller
From MaRDI portal
Publication:2912748
DOI10.1007/978-3-642-32589-2_44zbMath1365.68281OpenAlexW118140986MaRDI QIDQ2912748
Publication date: 25 September 2012
Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_44
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
New Results on Directed Edge Dominating Set ⋮ Space limited graph algorithms on big data ⋮ Space limited linear-time graph algorithms on big data ⋮ Approximate Turing Kernelization for Problems Parameterized by Treewidth ⋮ Towards optimal and expressive kernelization for \(d\)-hitting set ⋮ Maximum matching and kernelization of edge dominating set ⋮ Unnamed Item
This page was built for publication: Kernels for Edge Dominating Set: Simpler or Smaller
