| Presentation | 2017-12-22 Efficient Enumeration of Dominating Sets in K-Degenerate graphs Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | A dominating set is one of the fundamental graph structure, like clique, independent set, s-t path, and cut. It is known that there is a polynomial delay algorithm to enumerate theses minimal or maximal graph structures. However, it is open problem that there is a polynomial delay or amortized polynomial time algorithm to enumerate minimal dominating sets. In addition, enumeration of all dominating sets has not been paid much attention. In this paper, we enumerate all dominating sets not only minimal dominating sets. As a main result, we propose an efficient enumeration algorithm. This algorithm enumerates all dominating set in O (k) time per solution using O (nm) space, where k is degeneracy of an input graph. It is known that planar graphs have the constant degeneracy. Hence, the proposed algorithm enumerates all dominating set in constant time per solution. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | dominating sets / enumeration algorithm / amorized polynomial time / degeneracy |
| Paper # | ISEC2017-89,COMP2017-43 |
| Date of Issue | 2017-12-14 (ISEC, COMP) |
| Conference Information | |
| Committee | ISEC / COMP |
|---|---|
| Conference Date | 2017/12/21(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Eikokuji Campus, Kochi University of Technology |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Kazuto Ogawa(NHK) / Hiro Ito(Univ. of Electro-Comm.) |
| Vice Chair | Atsushi Fujioka(Kanagawa Univ.) / Shiho Moriai(NICT) / Yushi Uno(Osaka Pref. Univ.) |
| Secretary | Atsushi Fujioka(Tohoku Univ.) / Shiho Moriai(Tokai Univ.) / Yushi Uno(Seikei Univ.) |
| Assistant | Keita Emura(NICT) / Yuichi Komano(TOSHIBA) / Yuuji Suga(IIJ) |
| Paper Information | |
| Registration To | Technical Committee on Information Security / Technical Committee on Theoretical Foundations of Computing |
|---|---|
| Language | ENG-JTITLE |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Efficient Enumeration of Dominating Sets in K-Degenerate graphs |
| Sub Title (in English) | |
| Keyword(1) | dominating sets |
| Keyword(2) | enumeration algorithm |
| Keyword(3) | amorized polynomial time |
| Keyword(4) | degeneracy |
| 1st Author's Name | Kazuhiro Kurita |
| 1st Author's Affiliation | Hokkaido University(HU) |
| 2nd Author's Name | Kunihiro Wasa |
| 2nd Author's Affiliation | National Institute of Informatics(NII) |
| 3rd Author's Name | Takeaki Uno |
| 3rd Author's Affiliation | National Institute of Informatics(NII) |
| 4th Author's Name | Hiroki Arimura |
| 4th Author's Affiliation | Hokkaido University(HU) |
| Date | 2017-12-22 |
| Paper # | ISEC2017-89,COMP2017-43 |
| Volume (vol) | vol.117 |
| Number (no) | ISEC-369,COMP-370 |
| Page | pp.pp.111-117(ISEC), pp.111-117(COMP), |
| #Pages | 7 |
| Date of Issue | 2017-12-14 (ISEC, COMP) |