On the Complexity of Broadcast Domination and Multipacking in Digraphs (Q5041195): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-48966-3_20 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3028831290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcast domination and multipacking: bounds and the integrality gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4677956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel bounds for disjoint cycles and disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcast domination and multipacking in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for the broadcast domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear‐time algorithm for broadcast domination in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of broadcast domination and multipacking In digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2878206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal broadcast domination in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcast Domination on Block Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4604110 / rank
 
Normal rank

Latest revision as of 09:47, 30 July 2024

scientific article; zbMATH DE number 7601013
Language Label Description Also known as
English
On the Complexity of Broadcast Domination and Multipacking in Digraphs
scientific article; zbMATH DE number 7601013

    Statements

    On the Complexity of Broadcast Domination and Multipacking in Digraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 October 2022
    0 references
    broadcast domination
    0 references
    dominating set
    0 references
    multipacking
    0 references
    directed graphs
    0 references
    parameterized complexity
    0 references

    Identifiers