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

Development of efficient algorithms for solving the discrete optimization problems on intersection graphs.

Research Project

Project/Area Number 22500020
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Fundamental theory of informatics
Research InstitutionKushiro National College of Technology

Principal Investigator

HONMA Hirotoshi  釧路工業高等専門学校, 情報工学科, 准教授 (80249721)

Co-Investigator(Kenkyū-buntansha) MASUYAMA Shigeru  豊橋技術科学大学, 大学院・工学研究科, 教授 (60173762)
Project Period (FY) 2010 – 2012
Project Status Completed (Fiscal Year 2012)
Budget Amount *help
¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000)
Fiscal Year 2012: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2011: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2010: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Keywordsアルゴリズム理論 / 離散最適化 / 交差グラフ / アルゴリズム / グラフ理論 / グラフアルゴリズム / 台形グラフ / 置換グラフ / 要節点問題 / 関節節点問題 / 最小フィードバック節点問題 / フィードバック節点集合問題
Research Abstract

We developed an efficient algorithm for solving the feedback vertex set problem on trapezoid graphs. Furthermore, we constructed optimal parallel algorithms for solving the articulation vertex and hinge vertex problems on circular permutation graphs.

Report

(4 results)
  • 2012 Annual Research Report   Final Research Report ( PDF )
  • 2011 Annual Research Report
  • 2010 Annual Research Report
  • Research Products

    (10 results)

All 2013 2011 2010 Other

All Journal Article (6 results) (of which Peer Reviewed: 6 results) Presentation (4 results)

  • [Journal Article] A Linear-time Algorithm for Constructing a Spanning Tree on Circular Trapezoid Graphs.In press IEICE TRANSACTIONS on Fundamentals of Electronics2013

    • Author(s)
      Hirotoshi Honma, Yoko Nakajima,Haruka Aoshima and Shigeru Masuyama
    • Journal Title

      Communications and Computer Sciences

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] Linear time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs2013

    • Author(s)
      Hirotoshi Honma, Kodai Abe, Yoko Nakajima and Shigeru Masuyama
    • Journal Title

      IEICE TRANSACTIONS on Information andSystems

      Volume: Vol.E96D,No.3 Pages: 419-425

    • NAID

      10031167426

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs2013

    • Author(s)
      Hirotoshi Honma
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E96.D Issue: 3 Pages: 419-425

    • DOI

      10.1587/transinf.E96.D.419

    • NAID

      10031167426

    • ISSN
      0916-8532, 1745-1361
    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A Linear-time Algorithm for Constructing a Spanning Tree on Circular Trapezoid Graphs2013

    • Author(s)
      Hirotoshi Honma
    • Journal Title

      IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: --

    • NAID

      10031193789

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Erratum and Addendum to "A linear time algorithm for finding all hinge vertices of a permutation graph2011

    • Author(s)
      Hirotoshi Honma and Kodai Abe and Shigeru Masuyama
    • Journal Title

      InformationProcessing Letters

      Volume: Vol.111 Issue: 18 Pages: 891-894

    • DOI

      10.1016/j.ipl.2011.01.014

    • Related Report
      2012 Final Research Report 2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] An Algorithm for Minimum Feedback Vertex Set Problem on a Trapezoid Graph2011

    • Author(s)
      Hirotoshi Honma and YutaroKitamura and Shigeru Masuyama
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E94-A Issue: 6 Pages: 1381-1385

    • DOI

      10.1587/transfun.E94.A.1381

    • NAID

      10029802500

    • ISSN
      0916-8508, 1745-1337
    • Related Report
      2012 Final Research Report 2011 Annual Research Report
    • Peer Reviewed
  • [Presentation] 環状型台形グラフの全域木導出のための最適アルゴリズム2013

    • Author(s)
      本間宏利,増山繁
    • Organizer
      日本オペレーションズリサーチ学会
    • Place of Presentation
      東京大学
    • Related Report
      2012 Final Research Report
  • [Presentation] 影響度最大の要節点導出のための効率的アルゴリズム2011

    • Author(s)
      本間宏利,増山繁
    • Organizer
      日本オペレーションズリサーチ学会
    • Place of Presentation
      甲南大学
    • Related Report
      2012 Final Research Report 2011 Annual Research Report
  • [Presentation] Circular permutation graph における要節点導出のための最適並列アルゴリズム2010

    • Author(s)
      本間宏利,増山繁
    • Organizer
      日本オペレーションズリサーチ学会
    • Place of Presentation
      長崎大学
    • Related Report
      2012 Final Research Report
  • [Presentation] 環状型台形グラフの全域木導出のための最適アルゴリズム

    • Author(s)
      本間宏利
    • Organizer
      日本オペレーションズリサーチ学会
    • Place of Presentation
      東京大学
    • Related Report
      2012 Annual Research Report

URL: 

Published: 2010-08-23   Modified: 2019-07-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi