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

DOI10.1016/J.DAM.2015.09.005zbMATH Open1332.05137OpenAlexW2193891334MaRDI QIDQ260041FDOQ260041

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

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\)

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)

Cites Work

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

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)