Development of the enumeration algorithm for the problems on statistics

• Project/Area Number: 23650009
• Research Category: Grant-in-Aid for Challenging Exploratory Research
• Allocation Type: Multi-year Fund
• Research Field: Fundamental theory of informatics
• Research Institution: Tokai University
• Principal Investigator: MATSUI YASUKO 東海大学, 理学部, 准教授 (10264582)
• Project Period (FY): 2011 – 2013
• Project Status: Completed (Fiscal Year 2013)
• Budget Amount: ¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000); Fiscal Year 2013: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000); Fiscal Year 2012: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000); Fiscal Year 2011: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
• Keywords: アルゴリズム / 列挙 / コスト付き頂点彩色 / 木幅 / 組合せ最適化問題 / 列挙アルゴリズム / 離散構造 / 高速化 / 列挙算法 / 統計

Research Abstract

Enumeration algorithm is one of tools for analyzing of VLSI, big data, gene information, synthetic compounds etc.
In this research, we developed some enumeration algorithms for the problems on statistics. In particular, we proposed speedy enumeration algorithm for the optimal cost vertex coloring on some graphs, and had talks at some international conferences. we are summarizing the results in the paper.

Research Products

• [Journal Article] 木の最小コスト点彩色の列挙と一意性について (2013)
  • Author(s): 木坂健人，松井泰子
  • Journal Title: 情報処理学会研究報告 Volume: 143-14 Pages: 1-6
  • NAID: 110009550147
• [Journal Article] Polynomial-Time Perfect Q-Ising with a Vertex-Independent Noise (2011)
  • Author(s): Masaki Yamamoto, Shuji Kijima, Yasuko Matsui
  • Journal Title: Journal of Combinatorial Optimization Volume: Volume 22, No. 3 Issue: 3 Pages: 392-408
  • DOI: 10.1007/s10878-010-9309-7
  • Peer Reviewed
• [Presentation] Fast counting of the number of primitive sorting network on n elements (2013)
  • Author(s): Yuma Tanaka, Atsuko Ikegami, Yasuko Matsui, Katsuki Fujisawa, Yuichiro Yasui
  • Organizer: The 25th Workshop on Topological Graph Theory in Yokohama
  • Place of Presentation: 横浜国立大学(神奈川県)
  • Year and Date: 2013-11-22
• [Presentation] An enumeration algorithm for the optimal cost vertex colorings for trees (2013)
  • Author(s): Yasuko Matsui, Kento Kizaka
  • Organizer: 日本数学会2013年度秋季総合分科会
  • Place of Presentation: 愛媛大学(愛媛県)
  • Year and Date: 2013-09-24
• [Presentation] 木の最小コスト点彩色の列挙と一意性 (2013)
  • Author(s): Yasuko Matsui, Kento Kizaka
  • Organizer: 情報処理学会第143回アルゴリズム研究会
  • Place of Presentation: 飯坂温泉伊勢谷(福島県)
  • Year and Date: 2013-03-01
• [Presentation] 木の最小コスト点彩色の列挙と一意性 (2013)
  • Author(s): 木坂健人，松井泰子
  • Organizer: 第143回アルゴリズム研究会
  • Place of Presentation: 飯坂温泉伊勢谷
• [Presentation] Enumeration and uniqueness for optimal cost vertex colorings of trees (2012)
  • Author(s): Kento Kizaka, Yasuko Matsui
  • Organizer: 4th Pacific Workshop on Discrete Mathematics
  • Place of Presentation: 東海大学パシフィックセンター(Hawaii)
  • Year and Date: 2012-11-29
• [Presentation] An enumeration algorithm for the optimal cost vertex-colorings for trees (2012)
  • Author(s): Yasuko Matsui, Kento Kizaka
  • Organizer: 21th International Symposium on Mathematical Programming(ISMP 2012)
  • Place of Presentation: TU Berlin(Berlin)
  • Year and Date: 2012-08-21
• [Presentation] An enumeration algorithm for the optimal cost vertex-colorings for trees (2012)
  • Author(s): Yasuko Matsui, Kento Kizaka, and Horoki Yoshida
  • Organizer: 21st International Symposium on Mathematical Programming (ISMP 2012)
  • Place of Presentation: ベルリン工科大学
• [Presentation] Enumeration and uniqueness for optimal cost vertex colorings of trees (2012)
  • Author(s): Kento Kizaka, Yasuko Matsui, and Hiroki Yoshida
  • Organizer: 4th Pacific Workshop on Discrete Mathematics
  • Place of Presentation: ハワイ東海インターナショナルカレッジ
• [Presentation] 選挙区割りに付随した列挙問題について, ERATO湊離散構造処理系プロジェクト (2011)
  • Author(s): 松井泰子
  • Organizer: 2011年度秋のワークショップ
  • Place of Presentation: 支笏湖丸駒温泉(北海道)
  • Year and Date: 2011-11-01
• [Presentation] Independence complexes of multipartite graphs, posets and regular cell complexes (2011)
  • Author(s): 川村一宏, 八森正泰, 松井泰子
  • Organizer: 研究集会「変換群の幾何と組合せ論」
  • Place of Presentation: 京都大学数理解析研究所(京都府)
  • Year and Date: 2011-06-13
• [Presentation] 横棒数最小の円筒あみだくじの列挙について, ERATO湊離散構造処理系プロジェクト (2011)
  • Author(s): 松井泰子
  • Organizer: 2011年度初夏のワークショップ
  • Place of Presentation: 北海道大学(北海道)
  • Year and Date: 2011-06-11
• [Presentation] 最小横棒数の円筒アミダクジの列挙について (2011)
  • Author(s): 松井泰子
  • Organizer: ERATO湊離散構造処理系プロジェクト「2011年度 初夏のワークショップ」
  • Place of Presentation: 北海道大学
• [Presentation] Independence complexes of posets and cell complexes (2011)
  • Author(s): 川村一宏，八森正泰，松井泰子
  • Organizer: 変換群の幾何と組合せ論
  • Place of Presentation: 京都大学数理解析研究所
• [Presentation] 選挙区割りに付随した列挙問題について (2011)
  • Author(s): 松井泰子，堀田敬介
  • Organizer: ERATO湊離散構造処理系プロジェクト「2011年度 秋のワークショップ」
  • Place of Presentation: 北海道支笏湖
• [Presentation] Fast counting of the number of primitive sorting network on n elements
  • Author(s): Y. Tanaka, A. Ikegami, Y. Matsui, K. Fujisawa and Y. Yasui
  • Organizer: The 25th Workshop on Topological Graph Theory in Yokohama
  • Place of Presentation: 横浜国立大学
• [Presentation] An enumeration algorithm for the optimal cost vertex colorings for trees
  • Author(s): 松井泰子，木坂健人
  • Organizer: 日本数学会 2013年度秋季総合分科会
  • Place of Presentation: 愛媛大学
• [Book] ものづくりに役立つ経営工学の事典-180の知識- (2014)
  • Author(s): 松井泰子, 他
  • Total Pages: 383
  • Publisher: 朝倉出版
• [Book] (2013)
  • Author(s): 安藤清, 土屋守正, 松井泰子共著
  • Publisher: 森北出版
• [Book] 例題で学ぶグラフ理論 (2013)
  • Author(s): 安藤清，土屋守正，松井泰子
  • Total Pages: 160
  • Publisher: 森北出版