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

Graph Drawing Algorithms and Applications to VLSI Designs

Research Project

Project/Area Number 19500002
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Fundamental theory of informatics
Research InstitutionTohoku University

Principal Investigator

NISHIZEKI Takao  Tohoku University, 大学院・情報科学研究科, 教授 (80005545)

Co-Investigator(Kenkyū-buntansha) 周 暁  東北大学, 大学院・情報科学研究科, 准教授 (10272022)
伊藤 健洋  東北大学, 大学院・情報科学研究科, 助教 (40431548)
Co-Investigator(Renkei-kenkyūsha) XIAO Zhou  東北大学, 大学院・情報科学研究科, 准教授 (10272022)
ITO Takehiro  東北大学, 大学院・情報科学研究科, 助教 (40431548)
UCHIZAWA Kei  東北大学, 大学院・情報科学研究科, 助教 (90510248)
Project Period (FY) 2007 – 2008
Project Status Completed (Fiscal Year 2008)
Budget Amount *help
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2008: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2007: ¥3,250,000 (Direct Cost: ¥2,500,000、Indirect Cost: ¥750,000)
Keywordsアルゴリズム理論 / 離散構造 / 設計自動化 / グラフ描画 / VLSI設計
Research Abstract

これまでに平面グラフの埋め込みアルゴリズム, 矩形描画アルゴリズム, 凸描画アルゴリズム, 4連結平面グラフの直線描画アルゴリズム, 直交描画アルゴリズムなど数多くの効率のよいアルゴリズムを開発してきた。これらのもとに, 新しい描画形式である内部矩形描画, 面積指定8角形描画, 折れ曲り数最小な直交描画等に関する理論を確立し, 効率のよいアルゴリズムを開発し, VLSI配置・配線問題への応用を図った.

Report

(3 results)
  • 2008 Annual Research Report   Final Research Report ( PDF )
  • 2007 Annual Research Report
  • Research Products

    (26 results)

All 2009 2008 2007 Other

All Journal Article (16 results) (of which Peer Reviewed: 16 results) Presentation (7 results) Book (2 results) Remarks (1 results)

  • [Journal Article] Octagonal drawings of plane graphs with prescribed face areas2009

    • Author(s)
      Md. S. Rahman, K. Miura and T. Nishizeki
    • Journal Title

      Computational Geometry : Theory and Applications 42

      Pages: 214-230

    • NAID

      110003178794

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [Journal Article] Octagonal drawings of plane graphs with prescribed face areas2009

    • Author(s)
      M. S. Rahman, K. Miura, and T Nishizeki
    • Journal Title

      Computational Geometry : Theory and Applications 42

      Pages: 214-230

    • NAID

      110003178794

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Orthogonal drawings of series-parallel graphs with minimum bends2008

    • Author(s)
      X. Zhou and T. Nishizeki
    • Journal Title

      SIAM J. Discrete Math Vol.22, No.4

      Pages: 1570-1604

    • NAID

      110003499880

    • Related Report
      2008 Annual Research Report 2008 Final Research Report
    • Peer Reviewed
  • [Journal Article] Approximability of partitioning graphs with supply and demand2008

    • Author(s)
      T. Ito, E.D. Demaine, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.6

      Pages: 627-650

    • NAID

      110004851550

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [Journal Article] Convex grid drawings of plane graphs with rectangular contours2008

    • Author(s)
      K. Miura, A. Kamada and T. Nishizeki
    • Journal Title

      Journal of Graph Algorithms and Applications Vol.12, No.2

      Pages: 197-224

    • NAID

      130005444303

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [Journal Article] Improvements of HITS algorithms for spam links2008

    • Author(s)
      Y. Asano, Y. Tezuka and T. Nishizeki
    • Journal Title

      IEICE Trans. INF. & SYST Vol.E-91-D, No.2

      Pages: 200-208

    • NAID

      10026800918

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [Journal Article] A revised transformation protocol for unconditionally secure secret key exchange2008

    • Author(s)
      K. Koizumi, T. Mizuki and T. Nishizeki
    • Journal Title

      Theory Comput. Syst 42

      Pages: 187-221

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [Journal Article] Open rectangle-of-influence drawings of inner triangulated plane graphs2008

    • Author(s)
      K. Miura, T. Matsuno and T. Nishizeki
    • Journal Title

      Discrete and Computational Geometry Vol.12, No.2

      Pages: 197-224

    • NAID

      110004851549

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Approximability of partitioning graphs with supply and demand2008

    • Author(s)
      T. Ito, E. D. Demaine, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.6

      Pages: 627-650

    • NAID

      110004851550

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A revised transformation protocol for unconditionally secure secret key exchange2008

    • Author(s)
      K. Koizumi, T. Mizuki and T. Nishizeki
    • Journal Title

      Theory Comput Syst 42

      Pages: 187-221

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Total colorings of degenerate graphs2007

    • Author(s)
      S. Isobe, X. Zhou and T. Nishizeki
    • Journal Title

      Combinatorica Vol.27, No.2

      Pages: 167-182

    • NAID

      110003191839

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [Journal Article] Sufficient condition and algorithm for list total colorings of series-parallel graphs2007

    • Author(s)
      Y. Matsuo, X. Zhou and T. Nishizeki
    • Journal Title

      IEICE Trans. Fundamentals Vol.E90-A, No.5

      Pages: 907-916

    • NAID

      110007519153

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      T. Ito, A. Kato, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.5, No.2

      Pages: 304-322

    • NAID

      10015530666

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      T.Ito, A. Kato, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.5,No.2

      Pages: 304-322

    • NAID

      10015530666

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Sufficient condition and Algorithm for list total colorings of series-parallel graphs2007

    • Author(s)
      Y. Matsuo, X. Zhou and T. Nishizeki
    • Journal Title

      IEICE Trans. Fundamentals Vol.E90-A No.5

      Pages: 907-916

    • NAID

      110007519153

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Total colorings of degenerate graphs2007

    • Author(s)
      S. Isobe, X. Zhou and T. Nishizeki
    • Journal Title

      Combinatorica Vol.27No.2

      Pages: 167-182

    • NAID

      110003191839

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Presentation] Partitioning a weighted tree to subtrees of almost uniform size2008

    • Author(s)
      T. Ito, T. Uno, X. Zhou and T. Nishizeki
    • Organizer
      ISAAC 2008
    • Place of Presentation
      オーストラリア・ゴールドコースト
    • Year and Date
      2008-12-15
    • Related Report
      2008 Annual Research Report
  • [Presentation] Efficient compression of web graphs2008

    • Author(s)
      Y. Asano, Y. Miyawaki and T. Nishizeki
    • Organizer
      COCOON 2008
    • Place of Presentation
      中国・大連市
    • Year and Date
      2008-07-27
    • Related Report
      2008 Annual Research Report
  • [Presentation] Partitioning a weighted tree to subtrees of almost uniform size2008

    • Author(s)
      T. Ito, T. Uno, X. Zhou and T. Nishizeki
    • Organizer
      Proc. of ISAAC 2008, Lect. Notes in Comp. Sci
    • Place of Presentation
      Springer-verlag(5369, 196-207)
    • Related Report
      2008 Final Research Report
  • [Presentation] Efficient compression of web graphs2008

    • Author(s)
      Y. Asano, Y. Miyawaki and T. Nishizeki
    • Organizer
      Proc. of COCOON 2008, Lect. Notes in Comp. Sci
    • Place of Presentation
      Springer-verlag(5092, 1-11)
    • Related Report
      2008 Final Research Report
  • [Presentation] Improvements of HITS algorithms for spam links2007

    • Author(s)
      Y. Asano, Y. Tezuka and T. Nishizeki
    • Organizer
      Proc. of APWeb/Waim 2007, Lect. Notes in Comp. Sci
    • Place of Presentation
      Springer-verlag(4505, 479-490)
    • Related Report
      2008 Final Research Report
  • [Presentation] Orthogonal drawings of series-parallel graphs with minimum bends2007

    • Author(s)
      X. Zhou and T. Nishizeki
    • Organizer
      Proc. of WALCOM
    • Place of Presentation
      (3-12)
    • Related Report
      2008 Final Research Report
  • [Presentation] Inner rectangular drawings of plane graphs : application of graph drawing to VLSI layout2007

    • Author(s)
      T. Nishizeki
    • Organizer
      Proc. of WALCOM 2007
    • Place of Presentation
      (1-2)
    • Related Report
      2008 Final Research Report
  • [Book] Planar Graphs: Theory and Algorithms2008

    • Author(s)
      T. Nishizeki and N. Chiba
    • Total Pages
      240
    • Publisher
      Dover Publications
    • Related Report
      2008 Final Research Report
  • [Book] Planar Graphs : Theory and Algorithms2008

    • Author(s)
      T. Nishizeki and N. Chiba
    • Publisher
      Dover Publications
    • Related Report
      2008 Annual Research Report
  • [Remarks]

    • URL

      http://www.nishizeki.ecei.tohoku.ac.jp/

    • Related Report
      2008 Final Research Report

URL: 

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

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi