Kernels for edge dominating set: simpler or smaller

DOI10.1007/978-3-642-32589-2_44MaRDI QIDQ2912748zbMATH OpenOpenAlexFDO

Authors Torben Hagerup

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

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• New Parameterized Algorithms for the Edge Dominating Set Problem
• New parameterized algorithms for the edge dominating set problem
• An improved algorithm for parameterized edge dominating set problem
• An improved algorithm for parameterized edge dominating set problem
• Maximum matching and kernelization of edge dominating set

Cited in

(13)

• Maximum matching and kernelization of edge dominating set
• Streaming kernelization
• Kernelization of edge perfect code and its variants
• New parameterized algorithms for the edge dominating set problem
• Kernelization and Sparseness: the case of Dominating Set
• Towards optimal and expressive kernelization for \(d\)-hitting set
• New results on directed edge dominating set
• On kernelization for edge dominating set under structural parameters
• Approximate Turing Kernelization for Problems Parameterized by Treewidth
• Space limited graph algorithms on big data
• Space limited linear-time graph algorithms on big data
• Approximate Turing kernelization for problems parameterized by treewidth
• Parameterized complexity of generalizations of edge dominating set

This page was built for publication: Kernels for edge dominating set: simpler or smaller

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912748)