|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
https://hdl.handle.net/10119/13777
|
| Title: | Secure sets and defensive alliances in graphs: A faster algorithm and improved bounds |
| Authors: | Amano, Kazuyuki
Oo, Kyaw May
Otachi, Yota
Uehara, Ryuhei |
| Keywords: | secure set
fixed-parameter tractable algorithm
defensive alliance
hypercube |
| Issue Date: | 2015-03 |
| Publisher: | 電子情報通信学会 |
| Magazine name: | IEICE Transactions on Information and Systems |
| Volume: | E98-D |
| Number: | 3 |
| Start page: | 486 |
| End page: | 489 |
| DOI: | 10.1587/transinf.2014FCP0007 |
| Abstract: | 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. |
| Rights: | Copyright (C)2015 IEICE. Kazuyuki Amano, Kyaw May Oo, Yota Otachi, and Ryuhei Uehara, IEICE Transactions on Information and Systems, E98-D(3), 2015, 486-489. http://www.ieice.org/jpn/trans_online/ |
| URI: | https://hdl.handle.net/10119/13777 |
| Material Type: | publisher |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 21012.pdf | | 612Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
