Fast Manipulation Algorithms for Large Interval Data Set

• Project/Area Number: 24700130
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Multi-year Fund
• Research Field: Intelligent informatics
• Research Institution: Kobe University
• Principal Investigator: Saitoh Toshiki 神戸大学, 工学(系)研究科(研究院), 助教 (00590390)
• Project Period (FY): 2012-04-01 – 2016-03-31
• Project Status: Completed (Fiscal Year 2015)
• Budget Amount: ¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000); Fiscal Year 2014: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000); Fiscal Year 2013: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000); Fiscal Year 2012: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
• Keywords: アルゴリズム / 幾何データ / ZDD / 区間データ / データ構造 / 区間グラフ / 独立集合問題 / 支配集合問題 / バイオインフォマティクス / 列挙

Outline of Final Research Achievements

In this research, we developed algorithms for geometric data and graphs, and proposed efficient enumeration algorithms by using ZDDs. For geometric graphs, we obtained new knowledge for extended graph classes of interval graphs, and developed algorithms for partial extension problems and space efficient algorithms on intervals. We also presented efficient algorithms using ZDD for actual problems, for example, enumeration of phylogenies and evacuation assignments, and solving puzzles. These results were published in refereed international journals, refereed international conferences, and domestic workshops.

Research Products

• [Int'l Joint Research] University of British Columbia/Simon Fraser University(カナダ)
• [Int'l Joint Research] MIT(米国)
• [Int'l Joint Research] University of Wurzburg/Karlsruhe Institute of Technology(ドイツ)
• [Int'l Joint Research] CharlesUniversity/University of West Bohemia(チェコ)
• [Journal Article] Extending partial representations of proper and unit interval graphs (2016)
  • Author(s): Pavel Klavik, Jan Kratochvil, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, and Tomas Vyskocil
  • Journal Title: Algorithmica Volume: to appear Issue: 4 Pages: 1071-1104
  • DOI: 10.1007/s00453-016-0133-z
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Ferrers Dimension of Grid Intersection Graphs (2016)
  • Author(s): Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, and Ryuhei Uehara
  • Journal Title: Discrete Applied Mathematics Volume: to appear Pages: 130-135
  • DOI: 10.1016/j.dam.2015.05.035
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Swapping Labeled Tokens on Graphs (2015)
  • Author(s): Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
  • Journal Title: Theoretical Computer Science Volume: 印刷中 Pages: 81-94
  • DOI: 10.1016/j.tcs.2015.01.052
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] Extending partial representations of subclasses of chordal graphs (2015)
  • Author(s): Pavel Klavik, Jan Kratochvil, Yota Otachi, and Toshiki Saitoh
  • Journal Title: Theoretical Computer Science Volume: 576 Pages: 85-101
  • DOI: 10.1016/j.tcs.2015.02.007
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Approximating the path-distance-width for AT-free graphs and graphs in related classes (2013)
  • Author(s): Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, and Koichi Yamazaki
  • Journal Title: Discrete Applied Mathematics Volume: -- Pages: 69-77
  • DOI: 10.1016/j.dam.2012.11.015
  • Peer Reviewed
• [Journal Article] The complexity of the stamp folding problem (2013)
  • Author(s): Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, and Yoshio Okamoto
  • Journal Title: Theoretical Computer Science Volume: -- Pages: 13-19
  • DOI: 10.1016/j.tcs.2012.08.006
  • Peer Reviewed
• [Journal Article] Reconstruction Algorithms for Permutation Graphs and Distance-hereditary Graphs (2013)
  • Author(s): Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara
  • Journal Title: IEICE Transactions on Information and Systems Volume: Vol.E96-D, No.3 Pages: 426-432
  • NAID: 110007995584
  • Peer Reviewed
• [Journal Article] Subgraph Isomorphism in Graph Classes (2012)
  • Author(s): Shuji Kijima, Yota Otachi, Toshiki Saitoh, and Takeaki Uno
  • Journal Title: Discrete Mathematics Volume: vol. 312, issue 21 Issue: 21 Pages: 3164-3173
  • DOI: 10.1016/j.disc.2012.07.010
  • Peer Reviewed
• [Journal Article] Bipartite Permutation Graphs are Reconstructible (2012)
  • Author(s): Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara
  • Journal Title: Discrete Mathematics, Algorithms and Applications Volume: 4(3) Issue: 03 Pages: 1-14
  • DOI: 10.1142/s1793830912500395
  • NAID: 120005316240
  • Peer Reviewed
• [Journal Article] Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs (2012)
  • Author(s): Ryo Yoshinaka, Toshiki Saitoh, Jun Kawahara, Koji Tsuruma, Hiroaki Iwashita, and Shin-ichi Minato
  • Journal Title: Algorithms Volume: vol. 5, No. 2 Issue: 2 Pages: 176-213
  • DOI: 10.3390/a5020176
  • Peer Reviewed
• [Presentation] フロンティア法による「Ls in L」と「Sphinxes in Sphinx」の解の列挙 (2016)
  • Author(s): 兼本 樹, 斎藤 寿樹
  • Organizer: 組合せゲーム・パズル研究集会
  • Place of Presentation: 電気通信大学（東京都・調布市）
  • Year and Date: 2016-03-07
• [Presentation] 手数が少ない場合におけるグリッド上のボロノイゲームの解析 (2016)
  • Author(s): 杉本 晃弘，斎藤 寿樹，山口 一章，増田 澄男
  • Organizer: 組合せゲーム・パズル研究集会
  • Place of Presentation: 電気通信大学（東京都・調布市）
  • Year and Date: 2016-03-07
• [Presentation] Space Efficient and Output Sensitive Greedy Algorithms on Intervals (2015)
  • Author(s): Toshiki Saitoh, Takashi Horiyama, David Kirkpatrick, Yota Otachi, Ryuhei Uehara, Yushi Uno, Katsuhisa Yamanaka
  • Organizer: アルゴリズム研究会
  • Place of Presentation: 九大西新プラザ（福岡県・福岡市）
  • Year and Date: 2015-09-28
• [Presentation] Swapping Colored Tokens on Graphs (2015)
  • Author(s): Katsuhisa Yamanaka, Takashi Horiyama, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara and Yushi Uno
  • Organizer: The 14th Workshop on Algorithms and Data Structure (WADS 2015)
  • Place of Presentation: Victoria, Canada
  • Year and Date: 2015-08-05 – 2015-08-07
• [Presentation] Competitive Diffusion on Weighted Graphs (2015)
  • Author(s): Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka and Xiao Zhou
  • Organizer: The 14th Workshop on Algorithms and Data Structure (WADS 2015)
  • Place of Presentation: Victoria, Canada
  • Year and Date: 2015-08-05 – 2015-08-07
• [Presentation] Swapping Colored Tokens on Graphs (2015)
  • Author(s): Katsuhisa Yamanaka, Takashi Horiyama, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara and Yushi Uno
  • Organizer: The 14th Workshop on Algorithms and Data Structure (WADS 2015)
  • Place of Presentation: University of Victoria(Victoria・Canada)
  • Year and Date: 2015-08-05
  • Int'l Joint Research
• [Presentation] Competitive Diffusion on Weighted Graphs (2015)
  • Author(s): Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka and Xiao Zhou
  • Organizer: The 14th Workshop on Algorithms and Data Structure (WADS 2015)
  • Place of Presentation: University of Victoria(Victoria・Canada)
  • Year and Date: 2015-08-05
  • Int'l Joint Research
• [Presentation] Exact Algorithms for B-Bandwidth Problem with Restricted B (2014)
  • Author(s): Hiroshi Yukumoto, Toshiki Saitoh, Kazuaki Yamaguchi, and Sumio Masuda
  • Organizer: KOREA-JAPAN Joint Workshop on Algorithms and Computation (WAAC 2014)
  • Place of Presentation: Okinawa, Japan
  • Year and Date: 2014-07-13 – 2014-07-15
• [Presentation] Extending Partial Representations of Proper and Unit Interval Graphs (2014)
  • Author(s): Pavel Klavík, Jan Kratochivíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, and Tomáš Vyskočil
  • Organizer: The 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2014)
  • Place of Presentation: Copenhagen, Denmark
  • Year and Date: 2014-07-02 – 2014-07-04
• [Presentation] Swapping Labeled Tokens on Graphs (2014)
  • Author(s): atsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno
  • Organizer: The 7th International Conference on Fun with Algorithms (FUN 2014)
  • Place of Presentation: Sicily, Italy
  • Year and Date: 2014-07-01 – 2014-07-03
• [Presentation] Intersection Dimension of Bipartite Graphs (2014)
  • Author(s): Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, and Ryuhei Uehara
  • Organizer: The 11th Annual Conference on Theory and Applications of Models of Computation (TAMC 2014)
  • Place of Presentation: Chennai, India
  • Year and Date: 2014-04-11 – 2014-04-13
• [Presentation] 都市における避難所割当ての列挙と評価手法の研究 (2014)
  • Author(s): 中野 浩太郎，斎藤 寿樹，加藤 直樹，瀧澤 重志
  • Organizer: 情報処理学会全国大会
  • Place of Presentation: 東京電機大学
• [Presentation] 都市における避難所割当ての列挙と評価 (2014)
  • Author(s): 中野 浩太郎, 斎藤 寿樹, 瀧澤 重志, 加藤 直樹
  • Organizer: 日本オペレーションズリサーチ学会 2014年春季研究発表会
  • Place of Presentation: 大阪大学
• [Presentation] ZDDを用いたExact Cover問題に対するパレート最適な解の列挙 (2014)
  • Author(s): 松永 涼，斎藤 寿樹，近藤 広樹，中野 浩太郎
  • Organizer: アルゴリズム研究会
  • Place of Presentation: 中央大学
• [Presentation] あみだくじを数え上げる省領域アルゴリズムについて (2014)
  • Author(s): 中嶋 章裕，斎藤 寿樹，山口 一章，増田 澄男
  • Organizer: 組合せゲーム・パズルミニ研究集会
  • Place of Presentation: 北陸先端科学技術大学院大学
• [Presentation] 動的計画法を用いた有向二値完全系統樹の効率のよい列挙 (2014)
  • Author(s): 森戸 一貴, 斎藤 寿樹, 山口 一章, 増田 澄男
  • Organizer: コンピュテーション研究会
  • Place of Presentation: 小樽商科大学
• [Presentation] 動的計画法を用いた上界計算法による最大重みクリーク抽出アルゴリズムの提案 (2013)
  • Author(s): 清水 悟司, 山口 一章, 斎藤 寿樹, 増田 澄男
  • Organizer: 電子情報通信学会 コンピュテーション研究会
  • Place of Presentation: 岐阜大学
• [Presentation] 不完全データと矛盾しない有向二値完全系統樹を列挙する効率的手法 (2012)
  • Author(s): 清見 礼, 岡本 吉央, 斎藤 寿樹
  • Organizer: 電子情報通信学会 コンピュテーション研究会
  • Place of Presentation: 北海道大学
• [Book] 超高速グラフ列挙アルゴリズム－〈フカシギの数え方〉が拓く，組合せ問題への新アプローチ－ (2015)
  • Author(s): 湊 真一(編), ERATO湊離散構造処理系プロジェクト(著)（２章５章分担執筆）
  • Total Pages: 177
  • Publisher: 森北出版
• [Book] 超高速グラフ列挙アルゴリズム－〈フカシギの数え方〉が 拓く，組合せ問題への新アプローチ－ (2015)
  • Author(s): 湊 真一, ERATO湊離散構造処理系プロジェクト（斎藤含む）
  • Total Pages: 192
  • Publisher: 森北出版