IEICE Transactions on Information and Systems
Special Section on Foundations of Computer Science - New Spirits in Theory of Computation and Algorithm -
Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds
Kazuyuki AMANOKyaw May OOYota OTACHIRyuhei UEHARA
Author information

Volume E98.D (2015) Issue 3 Pages 486-489

Download PDF (275K) Contact us

Secure sets and defensive alliances in graphs are studied. They are sets of vertices that are safe in some senses. In this paper, we first present a fixed-parameter algorithm for finding a small secure set, whose running time is much faster than the previously known one. We then present improved bound on the smallest sizes of defensive alliances and secure sets for hypercubes. These results settle some open problems paused recently.

Information related to the author
© 2015 The Institute of Electronics, Information and Communication Engineers
Previous article Next article

Recently visited articles
Journal news & Announcements
  • Please contact trans-d [a], if you want to unlock PDF security.