Cargando…
On the Complexity of Broadcast Domination and Multipacking in Digraphs
We study the complexity of the two dual covering and packing distance-based problems Broadcast Domination and Multipacking in digraphs. A dominating broadcast of a digraph D is a function [Formula: see text] such that for each vertex v of D, there exists a vertex t with [Formula: see text] having a...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7254899/ http://dx.doi.org/10.1007/978-3-030-48966-3_20 |