| Presentation | 2018-10-26 [Invited Lecture] Report of Presentation in SEA2018 and Recent Study Yu Nakahata, Jun Kawahara, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Partitioning a graph into balanced components is important for several applications. For multi-objective problems, it is useful not only to find one solution but also to enumerate all the solutions with good values of objectives. However, there are a vast number of graph partitions in a graph, and thus it is difficult to enumerate the desired graph partitions efficiently. In this presentation, an algorithm to enumerate all the graph partitions such that all the weights of the connected components are at least a specified value is proposed. To deal with a large search space, we use zero-suppressed binary decision diagrams (ZDDs) to represent sets of graph partitions and we design a new algorithm based on frontier-based search, which is a framework to directly construct a ZDD. Our algorithm utilizes not only ZDDs but also ternary decision diagrams (TDDs) and realizes an operation which seems difficult to be designed only by ZDDs. Experimental results show that the proposed algorithm runs up to tens of times faster than an existing state-of-the-art algorithm. In the presentation, we report our presentation in SEA2018 and talk about the recent study. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Graph algorithm / Graph partitioning / Decision diagram / Frontier-based search / Enumeration problem |
| Paper # | COMP2018-29 |
| Date of Issue | 2018-10-19 (COMP) |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2018/10/26(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Kyoto University |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Toshihiro Fujito(Toyohashi Univ. of Tech.) |
| Vice Chair | Shinichi Nakano(Gunma Univ.) |
| Secretary | Shinichi Nakano(Kyoto Univ.) |
| Assistant | Kazuhisa Seto(Seikei Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Theoretical Foundations of Computing |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | [Invited Lecture] Report of Presentation in SEA2018 and Recent Study |
| Sub Title (in English) | |
| Keyword(1) | Graph algorithm |
| Keyword(2) | Graph partitioning |
| Keyword(3) | Decision diagram |
| Keyword(4) | Frontier-based search |
| Keyword(5) | Enumeration problem |
| 1st Author's Name | Yu Nakahata |
| 1st Author's Affiliation | Nara Institute of Science and Technology(NAIST) |
| 2nd Author's Name | Jun Kawahara |
| 2nd Author's Affiliation | Nara Institute of Science and Technology(NAIST) |
| Date | 2018-10-26 |
| Paper # | COMP2018-29 |
| Volume (vol) | vol.118 |
| Number (no) | COMP-268 |
| Page | pp.pp.57-57(COMP), |
| #Pages | 1 |
| Date of Issue | 2018-10-19 (COMP) |