On the complexity of broadcast domination and multipacking In digraphs
type: Item
instance of: scholarly article
title: On the complexity of broadcast domination and multipacking In digraphs
author: Florent Foucaud
author: Benjamin Gras
author: Anthony Perez
author: Florian Sikora
published in: Algorithmica
publication date: 2021-09-02T00:00:00Z
full work available at URL: https://arxiv.org/abs/2003.10570
full work available at URL: https://basepub.dauphine.psl.eu/handle/123456789/22057
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7390197
MaRDI profile type: Publication
OpenAlex ID: W3166525196
cites work: On the multipacking number of grid graphs
cites work: Broadcast domination and multipacking: bounds and the integrality gap
cites work: Q4677956
cites work: Kernel bounds for disjoint cycles and disjoint paths
cites work: Broadcast domination and multipacking in strongly chordal graphs
cites work: New bounds for the broadcast domination number of a graph
cites work: General bounds on limited broadcast domination
cites work: Q5009486
cites work: Parameterized Algorithms
cites work: A linear‐time algorithm for broadcast domination in a tree
cites work: Kernelization Lower Bounds Through Colors and IDs
cites work: Broadcasts in graphs
cites work: Planar 3DM is NP-complete
cites work: Q4821947
cites work: Faster fixed-parameter tractable algorithms for matching and packing problems
cites work: Exact exponential algorithms.
cites work: On the Complexity of Broadcast Domination and Multipacking in Digraphs
cites work: Q4198056
cites work: Some simplified NP-complete graph problems
cites work: Deciding First-Order Properties of Nowhere Dense Graphs
cites work: Optimal broadcast domination in polynomial time
cites work: Broadcast Domination on Block Graphs in Linear Time
cites work: Q5581642
cites work: Q4604110
cites work: Sparsity. Graphs, structures, and algorithms
DOI: 10.1007/S00453-021-00828-5
description: scientific article; zbMATH DE number 7390197