Automata, Languages and Programming
From MaRDI portal
Publication:5716859
DOI10.1007/11523468zbMath1084.91053OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716859
David Kempe, Éva Tardos, Jon M. Kleinberg
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Related Items
Seeding with Costly Network Information ⋮ An iterated greedy algorithm for finding the minimum dominating set in graphs ⋮ Burning and \(w\)-burning of geometric graphs ⋮ Contagion risks and security investment in directed networks ⋮ Unnamed Item ⋮ Contagion Source Detection in Epidemic and Infodemic Outbreaks: Mathematical Analysis and Network Algorithms ⋮ Math‐based reinforcement learning for the adaptive budgeted influence maximization problem ⋮ Optimal Dynamic Product Development and Launch for a Network of Customers ⋮ How to choose friends strategically ⋮ Approximation for maximizing monotone non-decreasing set functions with a greedy method ⋮ Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis ⋮ Strategic Influence in Social Networks ⋮ Bounded budget connection (BBC) games or how to make friends and influence people, on a budget ⋮ Preventing Unraveling in Social Networks: The Anchored $k$-Core Problem ⋮ How to Burn a Graph ⋮ Unnamed Item ⋮ Strategyproof mechanisms for competitive influence in networks ⋮ New trends in influence maximization models ⋮ On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence ⋮ Optimal majority dynamics for the diffusion of an opinion when multiple alternatives are available ⋮ Burning grids and intervals ⋮ Component-cardinality-constrained critical node problem in graphs ⋮ Hardness Results for Seeding Complex Contagion with Neighborhoods ⋮ Competitive Diffusion on Weighted Graphs ⋮ Applications of the inverse infection problem on bank transaction networks ⋮ A global optimization algorithm for target set selection problems ⋮ Discovering small target sets in social networks: a fast and effective algorithm ⋮ Graph representation learning for popularity prediction problem: A survey ⋮ Diffusion centrality: a paradigm to maximize spread in social networks ⋮ The modeling and analysis of the word-of-mouth marketing ⋮ Optimizing Spread of Influence in Social Networks via Partial Incentives ⋮ Adaptive Rumor Spreading ⋮ Least cost influence propagation in (social) networks ⋮ Positive influence maximization in signed social networks under independent cascade model ⋮ A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks ⋮ The neighborhood role in the linear threshold rank on social networks ⋮ Harmless sets in sparse classes ⋮ Competitive profit maximization in social networks ⋮ The differential of the line graph \(\mathcal{L} (G)\) ⋮ Price of Anarchy for the N-Player Competitive Cascade Game with Submodular Activation Functions ⋮ An L p Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model ⋮ Discovering the influential users oriented to viral marketing based on online social networks ⋮ Centralized and decentralized rumor blocking problems ⋮ Burning a graph is hard ⋮ A typology of social capital and associated network measures ⋮ Influence analysis: A survey of the state-of-the-art ⋮ Labelled graph strategic rewriting for social networks ⋮ A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality ⋮ The complexity of influence maximization problem in the deterministic linear threshold model ⋮ Higher order monotonicity and submodularity of influence in social networks: from local to global ⋮ Think globally, act locally: on the optimal seeding for nonsubmodular influence maximization ⋮ A diffusion model for churn prediction based on sociometric theory ⋮ Optimizing Opinions with Stubborn Agents ⋮ Competitive and collaborative influence in social networks ⋮ Combinatorial model and bounds for target set selection ⋮ On integer and bilevel formulations for the \(k\)-vertex cut problem ⋮ Approximability of the firefighter problem. Computing cuts over time ⋮ A note on maximizing the spread of influence in social networks ⋮ Triggering cascades on undirected connected graphs ⋮ The graph energy game ⋮ Maximum number of periodic orbits in parallel dynamical systems ⋮ Retracted article: ``A distance vector similarity metric for complex networks ⋮ Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks ⋮ A discount strategy in word-of-mouth marketing ⋮ New techniques for approximating optimal substructure problems in power-law graphs ⋮ Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results ⋮ Influence ranking of road segments in urban road traffic networks ⋮ Treewidth governs the complexity of target set selection ⋮ Latency-bounded target set selection in social networks ⋮ Influence maximization in the presence of vulnerable nodes: a ratio perspective ⋮ Approximating fixation probabilities in the generalized Moran process ⋮ Predecessor existence problems for finite discrete dynamical systems ⋮ Active influence spreading in social networks ⋮ Influence Maximization in Social Networks ⋮ The maximum clique interdiction problem ⋮ Competitive contagion in networks ⋮ An individual-based model of information diffusion combining friends' influence ⋮ A measure of identifying influential community based on the state of critical functionality ⋮ Marketing impact on diffusion in social networks ⋮ Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence ⋮ Deprecation based greedy strategy for target set selection in large scale social networks ⋮ The critical node detection problem in networks: a survey ⋮ A new algorithm for positive influence maximization in signed networks ⋮ Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions ⋮ Evaluating groups with the generalized Shapley value ⋮ Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems ⋮ On the approximability of positive influence dominating set in social networks ⋮ Lower bounds on the differential of a graph ⋮ Optimally learning social networks with activations and suppressions ⋮ Dynamic competition over social networks ⋮ Minimizing the expected complete influence time of a social network ⋮ The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs ⋮ Equilibrium games in networks ⋮ Dynamical attraction in parallel network models ⋮ Periods in XOR parallel dynamical systems over directed dependency graphs ⋮ A random algorithm for profit maximization in online social networks ⋮ Strategies for network security ⋮ Whom to befriend to influence people ⋮ PageRank Beyond the Web ⋮ The Routing of Complex Contagion in Kleinberg’s Small-World Networks ⋮ Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs ⋮ A primal-dual algorithm for the minimum partial set multi-cover problem ⋮ Labelled Graph Rewriting Meets Social Networks ⋮ Enumerating periodic orbits in sequential dynamical systems over graphs ⋮ A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs ⋮ Nonsubmodular constrained profit maximization from increment perspective ⋮ On the complexity of reasoning about opinion diffusion under majority dynamics ⋮ \(\beta\)-differential of a graph ⋮ k-Submodular maximization with two kinds of constraints ⋮ Influence diffusion in social networks under time window constraints ⋮ Spread of influence in weighted networks under time and budget constraints ⋮ Influence Diffusion in Social Networks under Time Window Constraints ⋮ On the complexity of the vector connectivity problem ⋮ Optimal intervention in economic networks using influence maximization methods ⋮ Exact solutions for latency-bounded target set selection problem on some special families of graphs ⋮ Detecting Bots and Assessing Their Impact in Social Networks
