• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Development of Efficient Algorithms on Gigantic Graphs

Research Project

Project/Area Number 18500009
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Fundamental theory of informatics
Research InstitutionJapan Advanced Institute of Science and Technology

Principal Investigator

UEHARA Ryuhei  Japan Advanced Institute of Science and Technology, School of Information Science, Associate Professor (00256471)

Project Period (FY) 2006 – 2007
Project Status Completed (Fiscal Year 2007)
Budget Amount *help
¥4,140,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥540,000)
Fiscal Year 2007: ¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000)
Fiscal Year 2006: ¥1,800,000 (Direct Cost: ¥1,800,000)
KeywordsAlgorithm / Information science / Mathematical science / Bioinformatics / グラフクラス / スケールフリー / 区間グラフ
Research Abstract

We developed some efficient algorithms which work on a large stale graph. Especially, our algorithms work efficiently on some graphs which have some structures. There are three kinds of problems of which our algorithms aim to solve as follows.
1. Problems come from bioinformatics': In the area of bioinformatics, we have to handle tons of data which have simple structure. The class of bipartite permutation graph is one of such graph classes. We develop linear time algorithms that solve maximum independent set and longest path on a graph in the class.
2. Graphs that have geometrical representations: We deal with some problems on graph classes that have geometric representations. For some problems, we give efficient algorithms, and for some problems, we prove that the problems are hard to solve efficiently. For example, we propose a game named "Voronoi game," which is a model for competitive resource distribution problem. We first show that this problem is theoretically intractable in general case. We next restrict the game board to having a tree structure, and in that case, we show that the first player has an advantage.
3. Problems on large networks: We investigate problems for finding a sparse graph in a given dense graph such that the resultant sparse graph has a desired connectivity. This problem comes from the real applications of designing a network like LAN. It is known that this problem is theoretically intractable in general case. We give some approximation algorithms for the problem on some restricted graph classes. We also give theoretical bounds of the algorithms.

Report

(3 results)
  • 2007 Annual Research Report   Final Research Report Summary
  • 2006 Annual Research Report
  • Research Products

    (43 results)

All 2008 2007 2006 Other

All Journal Article (20 results) (of which Peer Reviewed: 10 results) Presentation (19 results) Book (2 results) Remarks (2 results)

  • [Journal Article] Counting the Number of Independent Sets in Chordal Graphs2008

    • Author(s)
      Y. Okamoto, T. Uno, and R. Uehara
    • Journal Title

      Journal of Discrete Algorithms 6(2)

      Pages: 229-242

    • NAID

      120001063231

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Longest Path Problems on Ptolemaic Graphs2008

    • Author(s)
      Y. Takahara, S. Teramoto, and. R. Uehara
    • Journal Title

      IEICE Transactions E91-D

      Pages: 170-177

    • NAID

      10026800882

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Counting the Number of Independent Sets in Chordal Graphs2008

    • Author(s)
      Y. Okamoto, T. Uno, R. Uehara
    • Journal Title

      Journal of Discrete Algorithm 6(2)

      Pages: 229-242

    • NAID

      120001063231

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Longest Path Problems on Ptolemaic Graphs2008

    • Author(s)
      Y. Takahara, S. Teramoto, R. Uehara
    • Journal Title

      IEICE Transactions E91-D

      Pages: 170-177

    • NAID

      10026800882

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Longest Path Problems on Ptolemaic Graphs2008

    • Author(s)
      Y.Takahara, S.Teramoto, and R.Uehara
    • Journal Title

      IEICE Transactions E91-D

      Pages: 170-177

    • NAID

      10026800882

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Simple Geometrical Intersection Graphs2008

    • Author(s)
      R.Uehara
    • Journal Title

      Workshop on Algorithms and Computation LNCS4921

      Pages: 25-33

    • Related Report
      2007 Annual Research Report
  • [Journal Article] On Computing Longest Paths in Small Graph Classes2007

    • Author(s)
      R. Uehara and Y. Uno
    • Journal Title

      International Journal of Foundations of Computer Science 18(5)

      Pages: 911-930

    • NAID

      120001063250

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Linear Structure of Bipartite Permutation Graphs with an Application2007

    • Author(s)
      R. Uehara and G. Valiente
    • Journal Title

      Information Processing Letters 103(2)

      Pages: 71-77

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] Tree Spanners for Bipartite Graphs and Probe Interval. Graphs2007

    • Author(s)
      A. Brandstaedt, F. F. Dragan, H. O. Le, V. B. Le, and R. Uehara
    • Journal Title

      Algorithmica 47(1)

      Pages: 27-51

    • NAID

      120000861691

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
    • Peer Reviewed
  • [Journal Article] On Computing Longest Paths in Small Graph Classes2007

    • Author(s)
      R. Uehara, Y. Uno
    • Journal Title

      International Journal of Foundations of Computer Science 18(5)

      Pages: 911-930

    • NAID

      120001063250

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Linear Structure of Bipartite Permutation Graphs with anApplication2007

    • Author(s)
      R. Uehara, G. Valiente
    • Journal Title

      Information Processing Letters 103(2)

      Pages: 71-77

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] Tree Spanners for Bipartite Graphs and Probe Interval Graphs2007

    • Author(s)
      A. Brandstaedt, F.F. Dragan, H.O. Le, V.B. Le, R. Uehara
    • Journal Title

      Algorithmica 47(1)

      Pages: 27-51

    • NAID

      120000861691

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] On Computing Longest Paths in Small Graph Classes2007

    • Author(s)
      R.Uehara and Y.Uno
    • Journal Title

      International Journal of Foundations of Computer Science 18

      Pages: 911-930

    • NAID

      120001063250

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Simple Efficient Algorithm for MPQ-tree of an Interval Graph2007

    • Author(s)
      T.Saitoh, M.Kiyomi, and R.Uehara
    • Journal Title

      KOREA-JAPAN Joint Workshop on Algorithms and Computation

      Pages: 121-126

    • NAID

      110006343681

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Efficient Algorithms for Airline Problem2007

    • Author(s)
      S.i.Nakano, R.Uehara, and T.Uno
    • Journal Title

      Annual Conference on Theory and Applications of Models of Computation LNCS4484

      Pages: 428-439

    • NAID

      110004851551

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A New Approach to Graph Recognition and Applications to Distance Hereditary Graphs2007

    • Author(s)
      S.i.Nakano, R.Uehara, and T.Uno
    • Journal Title

      Annual Conference on Theory and Applications of Models of Computation LNCS4484

      Pages: 115-127

    • NAID

      120002511580

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Tree Spanners for Bipartite Graphs and Probe Interval Graphs2007

    • Author(s)
      A.Brandstaedt, F.F.Dragan, H.-O.Le, V.B.Le, R.Uehara
    • Journal Title

      Algorithmica 47 (1)

      Pages: 27-51

    • NAID

      120000861691

    • Related Report
      2006 Annual Research Report
  • [Journal Article] Site Consistency in Phylogenetic Networks with Recombination2006

    • Author(s)
      T. Asano, P. Evans, R. Uehara, G. Variente
    • Journal Title

      A chapter of "Algorithmic in Bioinformatics"

      Pages: 15-26

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Journal Article] The complexity of a Pop-up Book2006

    • Author(s)
      R.Uehara, S.Teramoto
    • Journal Title

      Canadian Conference on Computational Geometry 18

      Pages: 3-6

    • NAID

      110004824085

    • Related Report
      2006 Annual Research Report
  • [Journal Article] Voronoi game on graphs and its complexity2006

    • Author(s)
      S.Teramoto, E.D.Demaine, R.Uehara
    • Journal Title

      Symposium on Computational Intelligence and Games 2

      Pages: 265-271

    • NAID

      110004075873

    • Related Report
      2006 Annual Research Report
  • [Presentation] Scale Free Interval Graphs2008

    • Author(s)
      T.Shigezumi, N.Miyoshi, R.Uehara, and O.Watanabe
    • Organizer
      COMP-NHC学生シンポジウム
    • Place of Presentation
      東京都・早稲田大学
    • Year and Date
      2008-03-18
    • Related Report
      2007 Annual Research Report
  • [Presentation] Simple Geometrical Intersection Graphs2008

    • Author(s)
      R. Uehara
    • Organizer
      Workshop on Algorithms and Computation
    • Place of Presentation
      バングラデシュ大学(ダッカ・バングラデシュ)
    • Year and Date
      2008-02-08
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] Simple Geometrical Intersection Graphs2008

    • Author(s)
      R. Uehara
    • Organizer
      Workshop on Algorithms and Computation
    • Place of Presentation
      Bangladesh
    • Year and Date
      2008-02-08
    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] Bandwidth of Bipartite Permutation Graphs2007

    • Author(s)
      R.Uehara
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      愛知県・豊橋技術科学大学
    • Year and Date
      2007-09-20
    • Related Report
      2007 Annual Research Report
  • [Presentation] Simple Efficient Algorithm for MPQ-tree of an Interval Graph2007

    • Author(s)
      T. Saitoh, M. Kiyomi, and R. Uehara
    • Organizer
      KOREA-JAPAN Joint Workshop on Algorithms and Computation
    • Place of Presentation
      Chonnam National Univer city, Guangju, 韓国
    • Year and Date
      2007-08-10
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] Simple Efficient Algorithm for MPQ-tree of an Interval Graph2007

    • Author(s)
      T. Saitoh, M. Kiyomi, R. Uehara
    • Organizer
      Korea-Japan Joint Workshop on Algorithms and Computations
    • Place of Presentation
      Korea
    • Year and Date
      2007-08-10
    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] ある投票ゲームに関する戦略のモデル化2007

    • Author(s)
      上原 隆平、河村 泰之、松永 博充、元木 光雄
    • Organizer
      計算機科学の理論とその応用(LAシンポジウム)
    • Place of Presentation
      石川県・休暇村能登千里浜
    • Year and Date
      2007-07-18
    • Related Report
      2007 Annual Research Report
  • [Presentation] Do Interval Graphs Dream of Scale-free Network2007

    • Author(s)
      T.Shigezumi, R.Uehara, and O.Watanabe
    • Organizer
      計算機科学の理論とその応用(LAシンポジウム)
    • Place of Presentation
      石川県・休暇村能登千里浜
    • Year and Date
      2007-07-18
    • Related Report
      2007 Annual Research Report
  • [Presentation] Simple Efficient Algorithm for MPQ-tree of an Interval Graph2007

    • Author(s)
      T.Saitoh, M.Kiyomi, and R.Uehara
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      北海道・北海道大学
    • Year and Date
      2007-06-29
    • Related Report
      2007 Annual Research Report
  • [Presentation] Longest Path Problems on Ptolemaic Graphs2007

    • Author(s)
      Y. Takahara, S.Teramoto, and R. Uehara
    • Organizer
      The Kyoto International Conference on Computational Geometry, and Graph Theory
    • Place of Presentation
      京都大学・京都
    • Year and Date
      2007-06-11
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] Longest Path Problems on Ptolemaic Graphs2007

    • Author(s)
      Y. Takahara, S. Teramoto, R. Uehara
    • Organizer
      Kyoto Int. Conf. on Computational Geometry and Graph Theory
    • Place of Presentation
      Kyoto
    • Year and Date
      2007-06-11
    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] Efficient Algorithms for Airline Problem2007

    • Author(s)
      S.-i. Nakano, R. Uehara and T. Uno
    • Organizer
      Annual Conference on Theory and Applications of Models of Computation
    • Place of Presentation
      復坦大学、上海・中国
    • Year and Date
      2007-05-23
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] Efficient Algorithms for Airline Problem2007

    • Author(s)
      S.i. Nakano, R. Uehara, T. Uno
    • Organizer
      Annual Conference on Theory and Applications of Models of Computation
    • Place of Presentation
      China
    • Year and Date
      2007-05-23
    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] A New Approach to Graph Recognition and Applications to Distance Hereditary Graphs,2007

    • Author(s)
      S.-i. Nakano, R. Uehara and T. Uno
    • Organizer
      Annual Conference on Theory and Applications of Models of Computation
    • Place of Presentation
      復坦大学、上海・中国
    • Year and Date
      2007-05-22
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] A New Approach to Graph Recognition and Applications to Distance Hereditary Graphs2007

    • Author(s)
      S.i. Nakano, R. Uehara, T. Uno
    • Organizer
      Annual Conference on Theory and Applications of Models of Computation
    • Place of Presentation
      China
    • Year and Date
      2007-05-22
    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] The complexity of a Pop-up Book2006

    • Author(s)
      R. Uehara, and S. Teramoto
    • Organizer
      Canadian Conference on Computational Geometry
    • Place of Presentation
      クイーンズ大学(カナダ・オンタリオ州)
    • Year and Date
      2006-08-14
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] The complexity of a Pop-up Book2006

    • Author(s)
      R. Uehara, S. Teramoto
    • Organizer
      Canadian Conference on Computational Geometry
    • Place of Presentation
      Canada
    • Year and Date
      2006-08-14
    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] Voronoi game on graphs and its complexity2006

    • Author(s)
      S. Teramoto, E. D. Demaine, and R. Uehara
    • Organizer
      Symposium on Computational Intelligence and Games
    • Place of Presentation
      ネバダ大学(アメリカ・ネバダ州)
    • Year and Date
      2006-05-22
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Presentation] Voronoi game on graphs and its complexity2006

    • Author(s)
      S. Teramoto, E. D. Demaine, R. Uehara
    • Organizer
      Symposium on Computational Intelligence and Games
    • Place of Presentation
      USA
    • Year and Date
      2006-05-22
    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Book] Site Consistency in Phylogenetic Networks with Recombination(Algorithmic in Bioinformaticsの中の1章)2006

    • Author(s)
      T. Asano, P. Evans, R. Uehara, and G. Variente
    • Total Pages
      12
    • Publisher
      College Publications
    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2007 Final Research Report Summary
  • [Book] Site Consistency in Phylogenetic Networks with Recombination (Algorithmic in Bioinformaticsの中の1章)2006

    • Author(s)
      T.Asano, P.Evans, R.Uehara, G.Variente
    • Total Pages
      12
    • Publisher
      College Publications
    • Related Report
      2006 Annual Research Report
  • [Remarks] 「研究成果報告書概要(和文)」より

    • URL

      http://www.jaist.ac.jp/~uehara/pub/index.html

    • Related Report
      2007 Final Research Report Summary
  • [Remarks]

    • URL

      http://www.jaist.ac.jp/~uehara/pub/

    • Related Report
      2007 Annual Research Report

URL: 

Published: 2006-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi