On the Complexity of Broadcast Domination and Multipacking in Digraphs
From MaRDI portal
Publication:5041195
DOI10.1007/978-3-030-48966-3_20OpenAlexW3028831290MaRDI QIDQ5041195
Benjamin Gras, Florent Foucaud, Anthony Perez, Florian Sikora
Publication date: 13 October 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-48966-3_20
Related Items (1)
Cites Work
- Kernel bounds for disjoint cycles and disjoint paths
- Optimal broadcast domination in polynomial time
- New bounds for the broadcast domination number of a graph
- On the complexity of broadcast domination and multipacking In digraphs
- Broadcast domination and multipacking in strongly chordal graphs
- Broadcasts in graphs
- Broadcast Domination on Block Graphs in Linear Time
- Kernelization Lower Bounds Through Colors and IDs
- A linear‐time algorithm for broadcast domination in a tree
- Broadcast domination and multipacking: bounds and the integrality gap
- Parameterized Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the Complexity of Broadcast Domination and Multipacking in Digraphs