Research on techniques for algorithmic super-compression of huge data

• Project/Area Number: 18500012
• Research Category: Grant-in-Aid for Scientific Research (C)
• Allocation Type: Single-year Grants
• Section: 一般
• Research Field: Fundamental theory of informatics
• Research Institution: Kyoto University
• Principal Investigator: ITO Hiro Kyoto University, 大学院・情報学研究科, 准教授 (50283487)
• Co-Investigator(Kenkyū-buntansha): IWAMA Kazuo 京都大学, 大学院・情報学研究科, 教授 (50131272) ; 福田 宏 静岡県立大学, 経営情報学部, 准教授 (70238484) ; 中村 義作 静岡県立大学, 名誉教授 (20109200)
• Co-Investigator(Renkei-kenkyūsha): NAKAMURA Gisaku 静岡県立大学, 名誉教授 (20109200) ; FUKUDA Hiroshi 北里大学, 一般教養部, 准教授 (70238484)
• Project Period (FY): 2006 – 2008
• Project Status: Completed (Fiscal Year 2008)
• Budget Amount: ¥4,190,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥690,000); Fiscal Year 2008: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000); Fiscal Year 2007: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000); Fiscal Year 2006: ¥1,200,000 (Direct Cost: ¥1,200,000)
• Keywords: グラフ / アルゴリズム / 列挙 / 孤立 / 性質検査 / 定数時間アルゴリズム / インターネット / 連結度 / 線形時間アルゴリズム / 列挙アルゴリズム / クリーク / 多項式時間算法 / ゴスパー曲線 / コスパー曲線

Research Abstract

指数爆発あるいは入力そのものが巨大である等の理由で従来困難とされてきた問題に対し、本来の目的を失うことなく視点を変えることによって効率的に解くことができる技法について研究した.特にグラフに「孤立」の概念を導入して部分グラフを列挙する問題、グラフの連結度に関する性質検査、家系図列挙問題などについて効率的なアルゴリズムを与えた.また、一部の問題については、そのアルゴリズムの効率が、ある意味で限界値であることも示した.

Research Products

• [Journal Article] Multi-Commodity Source Location Problems and the Price of Greed (2009)
  • Author(s): Journal of Graph Algorithms and Applications
  • Journal Title: Journal of Graph Algorithms and Applications Vol. 13, No. 1(to appear) Pages: 55-73
• [Journal Article] Multi-Commodity Source Location Problems and the Price of Greed (2009)
  • Author(s): H. Ito, M. Paterson, K. Sugihara
  • Journal Title: Journal of Graph Algorithms and Applications 13 Pages: 55-73
  • Peer Reviewed
• [Journal Article] Enumeration of isolated cligues and pseudo-cliaues (2009)
  • Author(s): H. Ito, K. Iwama
  • Journal Title: ACM Transactions on Algorithms
  • Peer Reviewed
• [Journal Article] Property testing on k-vertex connectivity of graphs (2008)
  • Author(s): Yuichi YOSHIDA and Hiro ITO
  • Journal Title: Proceedings of the 31th International Colloquium on Automata, Language and Programming (ICALP 2008), LNCS, #5125, Springer 5125 Pages: 539-550
  • NAID: 10030998706
• [Journal Article] Transforming graphs with the same degree sequences (2008)
  • Author(s): Sergey BEREG and Hiro ITO
  • Journal Title: Proceedings of Kyoto International Conference on Computational Geometry and Graph Theory --- in honor of Jin Akiyama and Vasek Chvatal on their 60th birthdays 4535 Pages: 25-32
• [Journal Article] Maximum -cover source location problems with objective edge-connectivity three (2008)
  • Author(s): Kenya SUGIHARA and Hiro ITO
  • Journal Title: Mathematical Methods of Operations Research 10.1007
  • NAID: 110004735372
• [Journal Article] Multi-commodity source location problems and price of greed (2008)
  • Author(s): Hiro ITO, Mike PATERSON, and Kenya SUGIHARA
  • Journal Title: Proceedings of the Second Workshop on Algorithms and Computation (WALCOM2008) 4921
• [Journal Article] Inferring pedigrees from genetic distances (2008)
  • Author(s): Hiro ITO, Kazuo IWAMA, and Takeyuki TAMURA
  • Journal Title: IEICE Transactions Vol. E91-D, No. 2 Pages: 162-169
  • NAID: 110003206417
• [Journal Article] Property testing on k-vertex connectivity of graphs (2008)
  • Author(s): Y. Yoshida, H. Ito
  • Journal Title: Proceedings of the 31th International Colloquium on Automata, Language and Programming (ICALP 5125 Pages: 539-550
  • NAID: 10030998706
  • Peer Reviewed
• [Journal Article] Inferring pedigrees from genetic distances (2008)
  • Author(s): H. Ito, K. Iwama, T. Tamura
  • Journal Title: IEICE Transactions E91-D(2) Pages: 162-169
  • NAID: 110003206417
  • Peer Reviewed
• [Journal Article] Multi-commodity source location problems and price of greed (2008)
  • Author(s): H. Ito, M. Paterson, K. Sugihara
  • Journal Title: Proceedings of the Second Workshop on Algorithms and Computation, LNCS 4921 Pages: 169-179
  • Peer Reviewed
• [Journal Article] Transforming graphs with the same graphic sequences (2007)
  • Author(s): Sergey BEREG and Hiro ITO
  • Journal Title: Kyoto International Conference on Computational Geometry and Graph Theory --- in honor of Jin Akiyama and Vasek Chvatal on their 60th birthdays Pages: 11-15
• [Journal Article] Winning ways of weighted poset games, Akiyama -Chvatal Festschrift (2007)
  • Author(s): Hiro ITO, Gisaku NAKAMURA, and Satoshi TAKATA
  • Journal Title: Supplement of"Graphs and Combinatorics"
• [Journal Article] Semi-distance codes and Steiner systems, Akiyama-Chvatal Festschrift (2007)
  • Author(s): Hiro ITO, Midori KOBAYASHI, and Gisaku NAKAMURA
  • Journal Title: Supplement of "Graphs and Combinatorics Pages: 283-290
• [Journal Article] Snaky is a winner with one handicap (2007)
  • Author(s): H. Ito, H. Miyagawa
  • Journal Title: 8th Hellenic European Conference on Computer Mathematics and its Applications Pages: 25-26
  • Peer Reviewed
• [Journal Article] Semi-distance codes and Steigner systems (2007)
  • Author(s): H.Ito, K.Midori, N.Gisaku
  • Journal Title: Akiyama-Chvatal Festschrift, Supplement of Graph and Combinatorics (掲載確定)
• [Journal Article] Winning ways of weghted poset gammes (2007)
  • Author(s): H.Ito, G.Nakamura, S.Takata
  • Journal Title: Akiyama-Chvatal Festschrift, Supplement of Graph and Combinatorics (掲載確定)
• [Journal Article] Infinite series of generalized Gospher space filling curves (2007)
  • Author(s): J.Akiyama, H.Fukuda, H.Ito, G.Nakamura
  • Journal Title: Proceedings of the China-Japan Joint Conference on Discrete Geometry and Graph Theory, LNCS, Springer 4381 Pages: 1-9
• [Journal Article] Impossibility of transformation of vertex labeled simple graphs preserving the cut-size order (2007)
  • Author(s): H.Ito
  • Journal Title: Proceedings of the China-Japan Joint Conference on Discrete Geometry and Graph Theory, LNCS, Springer 4381 Pages: 59-69
• [Journal Article] Transformting graphs with the same graphic sequences (2007)
  • Author(s): S.Bereg, H.Ito
  • Journal Title: Kyoto International Conference on Computational Geometry and Graph Theory (掲載確定)
• [Journal Article] Maximum-cover source-location problem with object edge-connectivity three (2006)
  • Author(s): K.Sugihara, H.Ito
  • Journal Title: Proceedings of CTW2006 Workshop on Graphs and Combinatorics Pages: 131-136
  • NAID: 110004735372
• [Journal Article] Enumeration of isolated cliques and pseudo -cliques
  • Author(s): Hiro ITO and Kazuo IWAMA
  • Journal Title: ACM Transactions on Algorithms to appear
• [Journal Article] Testing k-edge-connectivity of digraphs
  • Author(s): Yuichi YOSHIDA and Hiro ITO
  • Journal Title: Journal of System Science and Complexity to appear
  • NAID: 110006343677
• [Presentation] 無秩序の代償(price of anarchy)の理論入門, 第5回日本OR学会中部支部シンポジウム「インターネット時代のゲーム理論」 (2008)
  • Author(s): 伊藤大雄
  • Organizer: 第二豊田ビル(西館)8 階第1 会議室
  • Place of Presentation: 名古屋
  • Year and Date: 2008-09-05
• [Presentation] 21世紀のネットワーク最適化, ORセミナー「最適化とその実用」 (2008)
  • Author(s): 伊藤大雄
  • Organizer: 構造計画研究所 本所新館
  • Place of Presentation: 東京
  • Year and Date: 2008-08-28
• [Presentation] 無向グラフのk 枝連結性の検査, 信学技報, COM2008-22 (2008)
  • Author(s): 吉田悠一, 伊藤大雄
  • Organizer: 電子情報通信学会コンピューテーション研究会(COMP)
  • Place of Presentation: 北陸先端科学技術大学院大学
  • Year and Date: 2008-06-16
• [Presentation] 無向グラフのk枝連結性の検査 (2008)
  • Author(s): 吉田悠一, 伊藤大雄
  • Organizer: 電子情報通信学会コンピューテーション研究会
  • Place of Presentation: 北陸先端科学技術大学院大学
  • Year and Date: 2008-06-16
• [Presentation] Constant time k-connectivity testing (2008)
  • Author(s): Y. Yoshida, H, Ito
  • Organizer: Chinese Academy of Sciences-Kyoto University Joint Workshop on Mathematical Methods for Informatics
  • Place of Presentation: Chinese Academy of Science,北京,中国
  • Year and Date: 2008-03-17
• [Presentation] FPT algorithm for the Hamiltonian circuit problem on unit disk graphs parametrized by the area, OR50 Annual Conference (OR50) (2008)
  • Author(s): Hiro ITO and Masakazu KADOSHITA
  • Organizer: Univ. of York
  • Place of Presentation: York, UK
• [Presentation] On k-connectivity testing in degree-bounded graphs (2008)
  • Author(s): Yuichi YOSHIDA and Hiro ITO
  • Organizer: The First Annual Meeting of Asian Association for Algorithms and Computation (AAAC08)
  • Place of Presentation: Hong Kong
• [Presentation] Constant time k-connectivity testing (2008)
  • Author(s): Yuichi YOSHIDA and Hiro ITO
  • Organizer: Chinese Academy of Sciences - Kyoto University Joint Workshop on Mathematical Methods for InformaticsEngineering and Management
  • Place of Presentation: Engineeringand Management, Beijing, China
• [Presentation] Testing k-connectivity on Degree Bounded Graphs (2008)
  • Author(s): Yuichi YOSHIDA and Hiro ITO
  • Organizer: Research Seminar on Connectivity of Graphs and Its Applications
  • Place of Presentation: SATAKE Memorial Hall, Hiroshima University
• [Presentation] Multi-commodity source location problems and price of greed (2007)
  • Author(s): H. Ito, M. Paterson, K. Sugihara
  • Organizer: 第6回情報科学技術フォーラム(FIT2007)
  • Place of Presentation: 中京大学 豊田キャンパス
  • Year and Date: 2007-09-06
• [Presentation] 有向グラフにおけるk 枝連結性の検査 信学技報, COM2007-18 (2007-06) (2007)
  • Author(s): 吉田悠一, 伊藤大雄
  • Organizer: 電子情報通信学会コンピューテーション研究会(COMP)
  • Place of Presentation: 北大
  • Year and Date: 2007-06-29
• [Presentation] 部の大きさの比が高々定数倍の孤立2部クリークの列挙, 信学技報, COM2007-18(2007-06) (2007)
  • Author(s): 宮川博光, 伊藤大雄, 岩間一雄
  • Organizer: 電子情報通信学会コンピューテーション研究会(COMP)
  • Place of Presentation: 北大
  • Year and Date: 2007-06-29
• [Presentation] 部の大きさの比が高々定数倍の孤立2部クリークの列挙 (2007)
  • Author(s): 宮川博光, 伊藤大雄, 岩間一雄
  • Organizer: 電子情報通信学会コンピューテーション研究会
  • Place of Presentation: 北海道大学
  • Year and Date: 2007-06-29
• [Presentation] 有向グラフにおけるk枝連結性の検査 (2007)
  • Author(s): 吉田悠一, 伊藤大雄
  • Organizer: 電子情報通信学会コンピューテーション研究会
  • Place of Presentation: 北海道大学
  • Year and Date: 2007-06-29
• [Presentation] Multicommodity source location problems and price of greed (2007)
  • Author(s): Hiro ITO, Mike PATERSON, and Kenya SUGIHARA
  • Organizer: FIT2007
  • Place of Presentation: 中京大豊田キャンパス
• [Presentation] Multicommodity source location problems and price of greed, Research Seminar on Connectivity of Graphs and Its Applications (2007)
  • Author(s): Hiro ITO, Mike PATERSON, and Kenya SUGIHARA
  • Organizer: SATAKE Memorial Holl
  • Place of Presentation: Hiroshima University