Small Alliances in Graphs

DOI10.1007/978-3-540-74456-6_21zbMath1147.68604OpenAlexW2112328127MaRDI QIDQ3525571

Rodolfo Carvajal, Ivan Rapaport, Martin Matamala, Nicolas Schabanel

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_21

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Parameterized complexity of locally minimal defensive alliances ⋮ Globally minimal defensive alliances ⋮ The complexity of the bootstraping percolation and other problems ⋮ On dissemination thresholds in regular and irregular graph classes ⋮ Aspects of upper defensive alliances ⋮ On the complement graph and defensive \(k\)-alliances ⋮ An inclusion hierarchy of irreversible dynamos

This page was built for publication: Small Alliances in Graphs