The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs

DOI10.1007/S10878-020-00671-4zbMath1468.90138OpenAlexW3102549175MaRDI QIDQ2025100

Xianliang Liu, Wei Wang, Zishen Yang

Publication date: 11 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00671-4

zbMATH Keywords

social networkstarget set selectionviral marketingtoroidal meshtoriadal cross

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Exact solutions for latency-bounded target set selection problem on some special families of graphs
• 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
• Recent developments on graphs of bounded clique-width
• 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
• Constant thresholds can make target set selection tractable
• Latency-bounded target set selection in social networks
• Bounding the Number of Tolerable Faults in Majority-Based Systems
• On the Approximability of Influence in Social Networks
• Target Set Selection Problem for Honeycomb Networks
• Automata, Languages and Programming

This page was built for publication: The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs