Combinatorics for smaller kernels: the differential of a graph
type: Item
instance of: scholarly article
title: Combinatorics for smaller kernels: the differential of a graph
zbMATH Open document ID: 1305.05216
author: Sergio Bermudo
author: Henning Fernau
published in: Theoretical Computer Science
publication date: 2014-12-02T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6375987
zbMATH Keywords: parameterized algorithm
zbMATH Keywords: kernelization
zbMATH Keywords: approximation algorithm
zbMATH Keywords: combinatorial bounds
zbMATH Keywords: differential of a graph
Wikidata QID: Q59864906
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.10.007
OpenAlex ID: W2042274748
cites work: An Improved Approximation Bound for Spanning Star Forest and Color Saving
cites work: Lower bounds on the differential of a graph
cites work: Computing the differential of a graph: hardness, approximability and exact algorithms
cites work: The differential and the roman domination number of a graph
cites work: Approximation algorithms for the test cover problem
cites work: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
cites work: Improved approximation algorithms for the spanning star forest problem
cites work: Roman domination in graphs.
cites work: SOFSEM 2006: Theory and Practice of Computer Science
cites work: Q4393480
cites work: R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
cites work: Defending the Roman Empire---a new strategy
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
cites work: On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
cites work: Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging
cites work: Q5488331
cites work: Domination in graphs with minimum degree two
cites work: Vertex packings: Structural properties and algorithms
cites work: Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
cites work: Paths, Stars and the Number Three
cites work: Enclaveless sets and MK-Systems
DBLP publication ID: journals/tcs/BermudoF15
DOI: 10.1016/J.TCS.2014.10.007
description: scientific article; zbMATH DE number 6375987