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

A study on Connectivity of Graphs and Its Applications

Research Project

Project/Area Number 15500011
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Fundamental theory of informatics
Research InstitutionHIROSHIMA UNIVERSITY

Principal Investigator

WATANABE Toshimasa  Hiroshima University, Graduate School of Engineering, Professor, 大学院・工学研究科, 教授 (80112184)

Co-Investigator(Kenkyū-buntansha) TAOKA Satoshi  Hiroshima University, Graduate School of Engineering, Research Associate, 大学院・工学研究科, 助手 (80274116)
TAKAFUJI Daisuke  Hiroshima University, Graduate School of Engineering, Research Associate, 大学院・工学研究科, 助手 (00314732)
Project Period (FY) 2003 – 2004
Project Status Completed (Fiscal Year 2004)
Budget Amount *help
¥3,800,000 (Direct Cost: ¥3,800,000)
Fiscal Year 2004: ¥1,400,000 (Direct Cost: ¥1,400,000)
Fiscal Year 2003: ¥2,400,000 (Direct Cost: ¥2,400,000)
KeywordsVertex connectivity of graphs / Edge connectivity of graphs / Design of algorithms / Efficiency of algorithms / Approximation algorithms / Performance ratios / Graph theory / Maximum flow / アルゴリスム設計
Research Abstract

The subject of this research project is to promote research on connectivity of graphs and its applications. More precisely, theoretical characterization and design of algorithms, with emphasis on practical usefulness, concerning the following three major fields : Analysis (detecting connectivity of given graphs), Extraction (extracting subgraphs having prescribed connectivity), and Construction (constructing graphs with given connectivity). Designing online and/or parallel/distributed algorithms is also included. The main achievements of this year are as follows.
I.Holding two research seminars focusing on introducing new problems as well as how to solve open problems.
・[At Hiroshima University, from 26 to 28 January 2004] The following leading researchers on connectivity participated the seminar : Prof.Andras Frank and Prof.Tibor Jordan from Eotvos Lorand University, Hungary, Prof.Takao Nishizeki of Tohoku University, Prof.Hiroshi Nagamochi and Prof.Toshimasa Ishii of Toyohashi Universi … More ty of Technology. In addition, one researcher in Hungary and four researchers in Japan attended.
・[At Hiroshima University, from 2 to 4 February 2005] The following leading researchers on connectivity participated the seminar : Prof.Andras Frank and Prof.Tibor Jordan from Eotvos Lorand University, Hungary, Prof.Hiroshi Nagamochi and Prof.Hiro Ito of Kyoto University, Prof.Kazuhisa Makino of Osaka University, Prof.Toshiya Mashima of Hiroshima International University.
II.Publication of the following 25 research papers.
1 Concerning "Construction" : (1)7 papers on connectivity augmentation problems for graphs in which each vertex has an upper bound on vertex-degree ; (2)2 papers on fast and sharp approximation algorithms for connectivity augmentation problems for the edge-weighted case. (3)7 papers on fast and sharp heuristic algorithms for constructing connected subgraphs satisfying certain conditions ; (4)One paper on a fast algorithm for extracting planar subgraphs ;
2 Concerning "Designing online or distributed algorithms" : (1)2 papers on parallel algorithms for extracting planar subgraphs ; (2)2 papers on searching paths in graphs ; (3)4 papers on parallel/distributed branch-and-bound algorithms. Less

Report

(3 results)
  • 2004 Annual Research Report   Final Research Report Summary
  • 2003 Annual Research Report
  • Research Products

    (62 results)

All 2005 2004 2003 Other

All Journal Article (52 results) Publications (10 results)

  • [Journal Article] A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase2005

    • Author(s)
      Takanori Fukuoka
    • Journal Title

      IEICE Trans. Fundamentals E88-A・4

      Pages: 954-963

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] A 2-Approximation Algorithm to (k+1)-Edge-Connect a Specified Set of Vertices in a k-Edge-Connected Graph2005

    • Author(s)
      Toshiya Mashima
    • Journal Title

      IEICE Trans. Fundamentals E88-A・5

      Pages: 1290-1300

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Minimum Augmentation to Bi-Connect Specified Vertices of a Graph with Upper Bounds on Vertex-Degree2005

    • Author(s)
      Toshiya Mashima
    • Journal Title

      Proc. 2005 IEEE International Symposium on Circuit and Systems

      Pages: 752-755

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Maximum Weight Matching-Based Algorithms for k-Edge-Connectivity Augmentation of a Graph2005

    • Author(s)
      Satoshi Taoka
    • Journal Title

      Proc. 2005 IEEE International Symposium on Circuit and Systems

      Pages: 2231-2234

    • NAID

      110003178767

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Approximation Algorithms for the Rectilinear Steiner Tree Problem with Obstacles2005

    • Author(s)
      Makoto Fujimoto
    • Journal Title

      Proc. 2005 IEEE International Symposium on Circuit and Systems

      Pages: 1362-1365

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Hierarchical Extraction of a Spanning Planar Subgraph Maintaining Clockwise Directedness of Cycles2005

    • Author(s)
      Daisuke Takafuji
    • Journal Title

      Proc. 2005 IEEE International Symposium on Circuit and Systems

      Pages: 172-175

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Performance Evaluation of PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem2005

    • Author(s)
      Yoshitaka Shimoda
    • Journal Title

      Proc. the 18th Workshop on Circuits and Systems in Karuizawa

      Pages: 253-258

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase2005

    • Author(s)
      Toshiya Mashima
    • Journal Title

      Proc. the 18th Workshop on Circuits and Systems in Karuizawa

      Pages: 637-642

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs2005

    • Author(s)
      Kazuya Watanabe
    • Journal Title

      Proc. the 18th Workshop on Circuits and Systems in Karuizawa

      Pages: 643-648

    • NAID

      110007502808

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Minimum 3-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Degree Constraints2005

    • Author(s)
      Toshiya Mashima
    • Journal Title

      IEICE Technical Report COMP2004-81

      Pages: 61-70

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Fast and Sharp Approximation Algorithms for the Rectilinear Steiner Tree Problem with Obstacles2005

    • Author(s)
      Makoto Fujimoto
    • Journal Title

      IEICE Technical Report CAS2004-102

      Pages: 31-36

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs2005

    • Author(s)
      Kazuya Watanabe
    • Journal Title

      IEICE Technical Report COMP2004-67

      Pages: 57-66

    • NAID

      110007502808

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Performance Evaluation of PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem2005

    • Author(s)
      Yoshitaka Shimoda
    • Journal Title

      IEICE Technical Report COMP2004-68

      Pages: 67-76

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase2005

    • Author(s)
      Takanori Fukuoka
    • Journal Title

      IEICE Trans. Fundamentals Vol.E88-A, No.4

      Pages: 954-963

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] A 2-Approximation Algorithm to (κ+1)-Edge-Connect a Specified Set of Vertices in a κ-Edge-Connected Graph2005

    • Author(s)
      Toshiya Mashima
    • Journal Title

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

      Pages: 1290-1300

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Minimum Augmentation to Bi-Connect Specified Vertices of a Graph with Upper Bounds on Vertex-Degree2005

    • Author(s)
      Toshiya Mashima
    • Journal Title

      Proc.2005 IEEE International Symposium on Circuit and Systems

      Pages: 752-755

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Maximum Weight Matching-Based Algorithms for κ-Edge-Connectivity Augmentation of a Graph2005

    • Author(s)
      Satoshi Taoka
    • Journal Title

      Proc.2005 IEEE International Symposium on Circuit and Systems

      Pages: 2231-2234

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Approximation Algorithms for the Rectilinear Steiner Tree Problem with Obstacles2005

    • Author(s)
      Makoto Fujimoto
    • Journal Title

      Proc.2005 IEEE International Symposium on Circuit and Systems

      Pages: 1362-1365

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Hierarchical Extraction of a Spanning Planar Subgraph Maintaining Clockwise Directedness of Cycles2005

    • Author(s)
      Daisuke Takafuji
    • Journal Title

      Proc.2005 IEEE International Symposium on Circuit and Systems

      Pages: 172-175

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Performance Evaluation of PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem2005

    • Author(s)
      Yoshitaka Shimoda
    • Journal Title

      Proc.the 18th Workshop on Circuits and Systems in Karuizawa

      Pages: 253-258

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Annual Research Report 2004 Final Research Report Summary
  • [Journal Article] Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase2005

    • Author(s)
      Toshiya Mashima
    • Journal Title

      Proc.the 18th Workshop on Circuits and Systems in Karuizawa

      Pages: 637-642

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Annual Research Report 2004 Final Research Report Summary
  • [Journal Article] Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs2005

    • Author(s)
      Kazuya Watanabe
    • Journal Title

      Proc.the 18th Workshop on Circuits and Systems in Karuizawa

      Pages: 643-648

    • NAID

      110007502808

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Annual Research Report 2004 Final Research Report Summary
  • [Journal Article] A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase2005

    • Author(s)
      Takanori Fukuoka
    • Journal Title

      IEICE Trans.Fundamentals E88-A・4(掲載予定)

    • Related Report
      2004 Annual Research Report
  • [Journal Article] A 2-Approximation Algorithm to (k+1)-Edge-Connect a Specified Set of Vertices in a k-Edge-Connected Graph2005

    • Author(s)
      Toshiya Mashima
    • Journal Title

      IEICE Trans.Fundamentals E88-A・5(掲載予定)

    • Related Report
      2004 Annual Research Report
  • [Journal Article] Minimum Augmentation to Bi-Connect Specified Vertices of a Graph with Upper Bounds on Vertex-Degree2005

    • Author(s)
      Toshiya Mashima
    • Journal Title

      Proc.2005 IEEE International Symposium on Circuit and Systems (掲載予定)

    • Related Report
      2004 Annual Research Report
  • [Journal Article] Maximum Weight Matching-Based Algorithms for k-Edge-Connectivity Augmentation of a Graph2005

    • Author(s)
      Satoshi Taoka
    • Journal Title

      Proc.2005 IEEE International Symposium on Circuit and Systems (掲載予定)

    • NAID

      110003178767

    • Related Report
      2004 Annual Research Report
  • [Journal Article] Approximation Algorithms for the Rectilinear Steiner Tree Problem with Obstacles2005

    • Author(s)
      Makoto Fujimoto
    • Journal Title

      Proc.2005 IEEE International Symposium on Circuit and Systems (掲載予定)

    • Related Report
      2004 Annual Research Report
  • [Journal Article] Hierarchical Extraction of a Spanning Planar Subgraph Maintaining Clockwise Directedness of Cycles2005

    • Author(s)
      Daisuke Takafuji
    • Journal Title

      Proc.2005 IEEE International Symposium on Circuit and Systems (掲載予定)

    • Related Report
      2004 Annual Research Report
  • [Journal Article] Minimum 3-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Degree Constraints2005

    • Author(s)
      Toshiya Mashima
    • Journal Title

      Technical Report of IEICE COMP2004-81

      Pages: 61-70

    • Related Report
      2004 Annual Research Report
  • [Journal Article] Fast and Sharp Approximation Algorithms for the Rectilinear Steiner Tree Problem with Obstacles2005

    • Author(s)
      Makoto Fujimoto
    • Journal Title

      Technical Report of IEICE CAS2004-102

      Pages: 31-36

    • Related Report
      2004 Annual Research Report
  • [Journal Article] Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs2005

    • Author(s)
      Kazuya Watanabe
    • Journal Title

      Technical Report of IEICE COMP2004-67

      Pages: 57-66

    • NAID

      110007502808

    • Related Report
      2004 Annual Research Report
  • [Journal Article] Performance Evaluation of PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem2005

    • Author(s)
      Yoshitaka Shimoda
    • Journal Title

      Technical Report of IEICE COMP2004-68

      Pages: 67-76

    • Related Report
      2004 Annual Research Report
  • [Journal Article] 点次数の増加上限制約を持つグラフの2点連結化問題2004

    • Author(s)
      福岡 孝悟
    • Journal Title

      第17回 回路とシステム軽井沢ワークショップ

      Pages: 639-644

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Efficient Extraction of a Planar Graph with Subgraphs whose Turning Over is Forbidden2004

    • Author(s)
      Toshiyuki Kinoshita
    • Journal Title

      IEICE Technical Report VLD2003-125

      Pages: 1-6

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Minimum 2-Vertex-Connectivity Augmentation for Specified Vertices of a Graph with Degree Constraints2004

    • Author(s)
      Toshiya Mashima
    • Journal Title

      IEICE Technical Report COMP2004-33

      Pages: 57-64

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Bi-Connectivity Augmentation Problems for Graphs with Upper Bounds on Vertex-Degree Increase2004

    • Author(s)
      Takanori Fukuoka
    • Journal Title

      Proc.the 17th Workshop on Circuits and Systems in Karuizawa

      Pages: 639-644

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Minimum 2-Vertex-Connectivity Augmentation for Specified Vertices of a Graph with Degree Constraints2004

    • Author(s)
      Toshiya Mashima
    • Journal Title

      Technical Report of IEICE COMP2004-33

      Pages: 57-64

    • Related Report
      2004 Annual Research Report
  • [Journal Article] A 2-Approximation Algorithm 2-ABIS for 2-Vertex-Connectivity Augmentation of Specified Vertices in a Graph2003

    • Author(s)
      Makoto Tamura
    • Journal Title

      IEICE Trans. Fundamentals E86-A・4

      Pages: 822-828

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] A 2-Approximation Algorithm FSA+1 to (λ+1)-Edge-Connect a Specified Set of Vertices in a λ-Edge-Connected Graph2003

    • Author(s)
      Satoshi Taoka
    • Journal Title

      Proc. 2003 IEEE International Symposium on Circuit and Systems

    • NAID

      110002811930

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] (2-2/|V|)-Approximation Algorithms for Several Graph Connectivity Related Problems2003

    • Author(s)
      Makoto Tamura
    • Journal Title

      IEICE Technical Report COMP2003-6

      Pages: 39-46

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] A Heuristic Algorithm AGRF for the Rectilinear Steiner Tree Problem with Obstacles2003

    • Author(s)
      Makoto Fujimoto
    • Journal Title

      IEICE Technical Report COMP2003-8

      Pages: 9-16

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Heuristic algorithms for extracting a planar graph with subgraphs forbidding their turning over2003

    • Author(s)
      Daisuke Takafuji
    • Journal Title

      IPSJ SIG Technical Report 2003-AL-91

      Pages: 1-8

    • NAID

      10012519548

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] 最小重み点被覆問題に対する並列分枝限定法の性能評価2003

    • Author(s)
      下田 善隆
    • Journal Title

      IPSJ SIG Technical Report 2003-AL-91

      Pages: 51-58

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] グラフに対する最大供給分割問題解法の性能評価2003

    • Author(s)
      渡辺 一哉
    • Journal Title

      IPSJ SIG Technical Report 2003-AL-91

      Pages: 59-66

    • NAID

      110002811972

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] PCクラスタ並列分枝限定解法における節点・変数選択規則の実験的評価2003

    • Author(s)
      田岡 智志
    • Journal Title

      IEICE Technical Report COMP2003-7

      Pages: 47-54

    • NAID

      110003178784

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Maximum Weight Matching-Based Algorithms for k-Edge-Connectivity Augmentation of a Graph2003

    • Author(s)
      Satoshi Taoka
    • Journal Title

      IEICE Technical Report COMP2003-26

      Pages: 17-24

    • NAID

      110003178767

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] A 2-Approximation Algorithm 2-ABIS for 2-Vertex-Connectivity Augmentation of Specified Vertices in a Graph2003

    • Author(s)
      Makoto Tamura
    • Journal Title

      IEICE Trans.Fundamentals Vol.E86-A, No.4

      Pages: 822-828

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] A 2-Approximation Algorithm FSA+1 to (λ+1)-Edge-Connect a Specified Set of Vertices in a λ-Edge-Connected Graph2003

    • Author(s)
      Satoshi Taoka
    • Journal Title

      Proc.2003 IEEE International Symposium on Circuit and Systems

    • NAID

      110002811930

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Performance Evaluation of Parallel Branch-and-Bound Algorithms for the Weighted Vertex Cover Problem2003

    • Author(s)
      Yoshitaka Shimoda
    • Journal Title

      IPSJ SIG Technical Report 2003-AL-91

      Pages: 51-58

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Experimental Evaluation of Algorithms for Maximum-Supply Partitioning of Demand-Supply Graph2003

    • Author(s)
      Kazuya Watanabe
    • Journal Title

      IPSJ SIG Technical Report 2003-AL-91

      Pages: 59-66

    • NAID

      110002811972

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Experimental Evaluation of Node-Variable Selection Rules in PC Cluster-based Parallel Branch-and-Bound Algorithms2003

    • Author(s)
      Satoshi Taoka
    • Journal Title

      IEICE Technical Report COMP2003-7

      Pages: 47-54

    • NAID

      110003178784

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Journal Article] Maximum Weight Matching-Based Algorithms for κ-Edge-Connectivity Augmentation of a Graph2003

    • Author(s)
      Satoshi Taoka
    • Journal Title

      IEICE Technical Report COMP2003-26

      Pages: 17-24

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2004 Final Research Report Summary
  • [Publications] Makoto Tamura: "A 2-Approximation Algorithm 2-ABIS for 2-Vertex-Connectivity Augmentation of Specified Vertices in a Graph"IEICE Technical Report. E86-A・4. 822-828 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] Satoshi Taoka: "A 2-Approximation Algorithm FSA+1 to (λ+1)-Edge-Connect a Specified Set of Vertices in a λ-Edge-Connected Graph"Proc.2003 IEEE International Symposium on Circuit and Systems. III-236-III-239 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] 福岡 孝悟: "点次数の増加上限制約を持つグラフの2点連結化問題"第17回 回路とシステム軽井沢ワークショップ. (掲載予定). (2004)

    • Related Report
      2003 Annual Research Report
  • [Publications] Makoto TAMURA: "(2-2/|V|)-Approximation Algorithms for Several Graph Connectivity Realated Problems"IEICE Technical Report. COMP2003-6. 39-46 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] Makoto Fujimoto: "A Heuristic Algorithm AGRF for the Rectilinear Steiner Tree Problem with Obstacles"IEICE Technical Report. COMP2003-8. 9-16 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] Daisuke Takafuji: "Heuristic algorithms for extracting a planar graph with subgraphs forbidding their turning over"IPSJ SIG Technical Report. 2003-AL-91. 1-8 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] 下田 善隆: "最小重み点被覆問題に対する並列分枝限定法の性能評価"IPSJ SIG Technical Report. 2003-AL-91. 51-58 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] 渡辺 一哉: "グラフに対する最大供給分割問題解法の性能評価"IPSJ SIG Technical Report. 2003-AL-91. 59-66 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] Toshiyuki Kinoshita: "Efficient Extraction of a Planar Graph with Subgraphs whose Turning Over is Forbidden"IEICE Technical Report. VLD2003-125. 1-6 (2004)

    • Related Report
      2003 Annual Research Report
  • [Publications] 田岡 智志: "PCクラスタ並列分岐限定解法における接点、辺数選択規則の実験評価"IEICE Technical Report. COMP2003-7. 47-54 (2003)

    • Related Report
      2003 Annual Research Report

URL: 

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

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi