The power of small coalitions in graphs

DOI10.1016/S0166-218X(02)00241-XzbMath1025.68061OpenAlexW2030865399MaRDI QIDQ1811064

Yanyan Li

Publication date: 10 June 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00241-x

zbMATH Keywords

coalition of vertices

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Generalized threshold processes on graphs ⋮ A study of monopolies in graphs ⋮ The complexity of open k-monopolies in graphs for negative k ⋮ Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs ⋮ Triggering cascades on undirected connected graphs ⋮ On reversible cascades in scale-free and Erdős-Rényi random graphs ⋮ Spreading of messages in random graphs ⋮ Multi-level dynamo and opinion spreading ⋮ Unnamed Item ⋮ Irreversible conversion processes with deadlines ⋮ Triggering cascades on strongly connected directed graphs ⋮ Reversible iterative graph processes ⋮ Irreversible conversion of graphs ⋮ Near-optimal solutions for the generalized max-controlled set problem ⋮ An improved derandomized approximation algorithm for the max-controlled set problem ⋮ Approximability of open \(k\)-monopoly problems ⋮ Size bounds for dynamic monopolies ⋮ Spreading messages ⋮ An inclusion hierarchy of irreversible dynamos

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item