Pervasive domination

DOI10.1007/978-3-031-18530-4_21zbMATH Open1528.90265MaRDI QIDQ6166909FDOQ6166909

Authors: Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno 

Publication date: 3 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

domination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Networks, crowds and markets. Reasoning about a highly connected world.
• Title not available (Why is that?)
• An analysis of the greedy algorithm for the submodular set covering problem
• How hard is it to bribe the judges? A study of the complexity of bribery in judgment aggregation
• On the approximability and exact algorithms for vector domination and related problems in graphs
• The computational difficulty of manipulating an election
• Control and Bribery in Voting
• A note on maximizing a submodular set function subject to a knapsack constraint
• Approximation algorithm for partial positive influence problem in social network
• Active influence spreading in social networks
• Influence Diffusion in Social Networks under Time Window Constraints
• Dual Domination
• A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks
• Whom to befriend to influence people
• Evangelism in social networks: Algorithms and complexity
• Title not available (Why is that?)
• Fast and frugal targeting with incentives

Cited In (6)

• Monopolizing Violence and Consolidating Power*
• Eternally dominating large grids
• Topics on domination
• Blockbusting and domineering
• Critical concepts in domination
• The many facets of upper domination

This page was built for publication: Pervasive domination

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