| Presentation | 2019-10-25 Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara, Taiga Sone, Akihiro Yamamoto, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | |
| Paper # | COMP2019-27 |
| Date of Issue | 2019-10-18 (COMP) |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2019/10/25(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Sapporo Campus, Hokkaido 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(Kumamoto Univ) |
| Assistant | Kazuhisa Seto(Seikei Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Theoretical Foundations of Computing |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem |
| Sub Title (in English) | |
| Keyword(1) | |
| 1st Author's Name | Yasuaki Kobayashi |
| 1st Author's Affiliation | Kyoto University(Kyoto Univ.) |
| 2nd Author's Name | Kensuke Kojima |
| 2nd Author's Affiliation | Kyoto University(Kyoto Univ.) |
| 3rd Author's Name | Norihide Matsubara |
| 3rd Author's Affiliation | Kyoto University(Kyoto Univ.) |
| 4th Author's Name | Taiga Sone |
| 4th Author's Affiliation | Kyoto University(Kyoto Univ.) |
| 5th Author's Name | Akihiro Yamamoto |
| 5th Author's Affiliation | Kyoto University(Kyoto Univ.) |
| Date | 2019-10-25 |
| Paper # | COMP2019-27 |
| Volume (vol) | vol.119 |
| Number (no) | COMP-249 |
| Page | pp.pp.63-70(COMP), |
| #Pages | 8 |
| Date of Issue | 2019-10-18 (COMP) |