Parameterized complexity of influence maximization

DOI10.1007/978-981-95-0218-9_18MaRDI QIDQ6866530zbMATH OpenFDO

Authors Panfeng Liu, Biaoshuai Tao

Publication date 28 January 2026

Full work available at URL https://doi.org/10.1007/978-981-95-0218-9_18

zbMATH Keywords

parameterized complexityinfluence maximization

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• scientific article; zbMATH DE number 5485529 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• A fast and effective heuristic for discovering small target sets in social networks
• Active influence spreading in social networks
• Automata, Languages and Programming
• Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization
• Constant thresholds can make target set selection tractable
• Fundamentals of parameterized complexity
• Influence Maximization in Undirected Networks
• Maximizing social influence in nearly optimal time
• On the approximability of influence in social networks
• Parameterized approximability of maximizing the spread of influence in networks
• Submodularity of influence in social networks: from local to global
• Think globally, act locally: on the optimal seeding for nonsubmodular influence maximization
• Treewidth governs the complexity of target set selection

This page was built for publication: Parameterized complexity of influence maximization

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