Exact solutions for latency-bounded target set selection problem on some special families of graphs (Q260041): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.09.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2193891334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial model and bounds for target set selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth governs the complexity of target set selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Number of Tolerable Faults in Majority-Based Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximability of Influence in Social Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on the target set selection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Target Set Selection Problem for Honeycomb Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Thresholds Can Make Target Set Selection Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latency-Bounded Target Set Selection in Social Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On time versus size for monotone dynamic monopolies in regular topologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dynamic monopolies of graphs: the average and strict majority thresholds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local majorities, coalitions and monopolies in graphs: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dynamic monopolies of graphs with general thresholds / rank
 
Normal rank

Latest revision as of 15:06, 11 July 2024

scientific article
Language Label Description Also known as
English
Exact solutions for latency-bounded target set selection problem on some special families of graphs
scientific article

    Statements

    Exact solutions for latency-bounded target set selection problem on some special families of graphs (English)
    0 references
    0 references
    0 references
    0 references
    18 March 2016
    0 references
    social networks
    0 references
    viral marketing
    0 references
    target set selection
    0 references
    majority threshold
    0 references

    Identifiers