Exact solutions for latency-bounded target set selection problem on some special families of graphs

DOI10.1016/J.DAM.2015.09.005MaRDI QIDQ260041zbMATH OpenOpenAlexFDO

Authors Xianliang Liu, Zishen Yang, Wei Wang

Publication date 18 March 2016

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2015.09.005

zbMATH Keywords

social networksmajority thresholdtarget set selectionviral marketing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Social networks; opinion dynamics (91D30) Approximation algorithms (68W25)

Recommendations

• The t-latency bounded strong target set selection problem in some kinds of special family of graphs
• Latency-bounded target set selection in social networks
• Latency-bounded target set selection in social networks
• Target set selection with maximum activation time
• Solving target set selection with bounded thresholds faster than \(2^n\)

Cites work

• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Automata, Languages and Programming
• Bounding the number of tolerable faults in majority-based systems
• Combinatorial model and bounds for target set selection
• Constant thresholds can make target set selection tractable
• Latency-bounded target set selection in social networks
• Local majorities, coalitions and monopolies in graphs: A review
• On dynamic monopolies of graphs with general thresholds
• On dynamic monopolies of graphs: the average and strict majority thresholds
• On the approximability of influence in social networks
• On time versus size for monotone dynamic monopolies in regular topologies
• Recent developments on graphs of bounded clique-width
• Some results on the target set selection problem
• Target set selection problem for honeycomb networks
• Treewidth governs the complexity of target set selection

Cited in

(4)

• The t-latency bounded strong target set selection problem in some kinds of special family of graphs
• Target set selection in Cartesian product graphs.
• Fast and frugal targeting with incentives
• Latency-bounded target set selection in social networks

This page was built for publication: Exact solutions for latency-bounded target set selection problem on some special families of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q260041)