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