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

ネットワーク最適化問題の解法効率化に関する研究

Research Project

Project/Area Number 10205219
Research Category

Grant-in-Aid for Scientific Research on Priority Areas (B)

Allocation TypeSingle-year Grants
Research InstitutionHiroshima University

Principal Investigator

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

Project Period (FY) 1998 – 2000
Project Status Completed (Fiscal Year 2001)
Budget Amount *help
¥10,300,000 (Direct Cost: ¥10,300,000)
Fiscal Year 2000: ¥2,700,000 (Direct Cost: ¥2,700,000)
Fiscal Year 1999: ¥3,400,000 (Direct Cost: ¥3,400,000)
Fiscal Year 1998: ¥4,200,000 (Direct Cost: ¥4,200,000)
KeywordsNetwork optimization problem / Survivable networks / Petri net invariants / Timed Petri net scheduling / Printed wiring board design / Graph drawing / Design and Analysis of algorithms / Distributed algorithms / アルゴリズム設計 / 計算複雑度 / 解法の効率化 / 近似解法 / 近似解の精度 / アルコリズム設計
Research Abstract

Purposes : Research on designing efficient algorithms for finding optimum solutions or sharp approximate ones to the network optimization problems.
Research results : They are divided into the following categories.
(1) Constructing survivable networks : Algorithms for finding optimum or approximate solutions to the connectivity augmentation problems are proposed, where designing networks that survive link or node faults is modeled as the connectivity augmentation problems. The following problems are considered. (i) K-edge-connectivity augmentation problems without creating multiple edges of a graph; (ii) K-edge-connectivity augmentation problems with upper bounds on edge multiplicity; (iii) Distributed algorithms for the k-edge-connectivity augmentation problems; (iv) Approximation algorithms for the Steiner tree problem of hypergraphs.
(2) Fundamental research on design and verification of communication protocols : Efficient algorithms for obtaining siphons or invariants of Petri nets ar … More e proposed, where verification or periodicity of communication protocols, respectively, is closely related to siphons or invariants or Petri nets that are used in modeling. The following problems are considered. (i) Extraction of minimal siphons; (ii) Computation of minimal support invariants.
(3) Solving scheduling problems : Scheduling problems are modeled as finding legal firing sequences in ordinary or timed Petri nets, and efficient heuristic algorithms are proposed.
(4) Designing printed wiring boards : Efficient heuristic algorithms for several fundamental problems in designing printed wiring boards are proposed. The following problems are considered. (i) Extracting spanning planar subgraphs; (ii) Routing problems; (iii) Constrained via minimization problems.
(5) Graph drawing : Efficient algorithms for drawing graphs on a given surface are proposed, where many practical constraints on graph drawing, such as minimizing total length or crossing of lines, specifying crossing points of certain lines, and so on, are satisfied.
(6) Others : A book entitled "Data Structures and Fundamental Algorithms" on design and analysis of algorithms is published, where basic concepts are explained in great detail by using many figures. Less

Report

(4 results)
  • 2001 Final Research Report Summary
  • 2000 Annual Research Report
  • 1999 Annual Research Report
  • 1998 Annual Research Report
  • Research Products

    (155 results)

All Other

All Publications (155 results)

  • [Publications] Takahashi, K., Watanabe, T.: "A Heuristic Algorithm to Solve Constrained via Minimization Three-Layer Routing Problems"Proc.1998 IEEE International Symposium on Circuits and Systems. Vol.6. VI254-VI257 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M., Watanabe, T.: "A Heuristic Algorithm FSD for the Legal Firing Sequence Problem of Petri Nets"Proc.1998 IEEE International Conference on Systems,Man and Cybernetics(SMC 98). 78-83 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M., Tanimoto, S., Watanabe, T.: "Extracting Siphons Containing a Specified Set of Places in a Petri Net"Proc.1998 IEEE International Conference on Systems,Man and Cybernetics(SMC 98). 142-147 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 藤戸 敏弘, 田岡 智志, 渡邉 敏正: "カクタス構造のペトリネットにおける発火系列問題について"第12回 回路とシステム(軽井沢)ワークショップ論文集. 213-218 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 高藤 大介, 渡邉 敏正: "4辺連結単純グラフの最小構成法"第12回 回路とシステム(軽井沢)ワークショップ論文集. 487-492 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mizuno, K., Kobayashi, T., Watanabe, T.: "Extracting Nonplanar Connections in a Terminal-Vertex Graph"Proc.1999 IEEE International Symposium on Circuit and Systems(ISCAS'99). VI-121-VI-124 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M., Watanabe, T.: "A Heuristic Algorithm SDS for Scheduling with Timed Petri Nets"Proc.1999 IEEE International Symposium on Circuit and Systems(ISCAS'99). VI-81-VI-84 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M., Wakuda, M., Taoka, S., Watanabe, T.: "A Fast and Space-Saving Algorithm for Computing Invariants of Petri Nets"Proc.1999 IEEE International Conference on Systems,Man and Cybernetics(SMC 99). I-866-I-871 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Taoka, S., Watanabe, T.: "A Linear Time Algorithm Solving the Legal Firing Sequence Problem for a Class of Edge-Weighted Cactuses"Proc.1999 IEEE International Conference on Systems,Man and Cybernetics(SMC 99). III-893-III-898 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M., Watanabe, T.: "Time Complexity Analysis of the Minimal Siphon Extraction Problem of Petri Nets"IEICE Trans.Fundamentals. Vol.E82-A,No.11. 2558-2565 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M., Watanabe, T.: "Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net"IEICE Trans.Fundamentals. Vol.E82-A,No.11. 2566-2575 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Fujito, T., Taoka, S., Watanabe, T.: "On the Legal Firing Sequence Problem of Petri Nets with Cactus Structure"IEICE Trans.Fundamentals. Vol.E83-A,No.3. 480-486 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nishi, S., Taoka, S., Watanabe, T.: "A Heuristic Algorithm FMD for the Minimum Initial Marking Problem of Petri Nets"Proc.13th Karuizawa Workshop on Circuits and Systems,IEICE of Japan. 275-280 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mashima, T., Watanabe, T.: "Graph Augmentation Problems with Degree-Unchangeable Vertices"Proc.13th Karuizawa Workshop on Circuits and Systems,IEICE of Japan. 167-172 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Takafuji, D., Taoka, S., Watanabe, T.: "k-Edge-Connectivity Augmentation Problem with Upper Bounds on Edge Multiplicity"Proc.2000 IEEE International Symposium on Circuit and Systems(ISCAS 2000). IV-601-IV-604 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Taoka, S., Watanabe, T.: "The (σ+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph"Lecture Notes in Computer Science 1872,Theoretical Computer Science,Springer-Verlag,Berlin. 169-185 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nishi, S., Taoka, S., Watanabe, T.: "A New Heuristic Method for Solving the Minimum Initial Marking Problem of Petri Nets"Proc.2000 IEEE International Conference on Systems,Man,and Cybernetics. 3218-3223 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nishi, S., Taoka, S., Watanabe, T.: "A Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets"IEICE Trans.Fundamentals. Vol.E84-A,No.3. 771-780 (2001)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mashima, T., Watanabe, T.: "Graph Augmentation Problems with Degree-Unchangeable Vertices"IEICE Trans.Fundamentals. Vol.E84-A,No.3. 781-793 (2001)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamaoki, T., Taoka, S., Watanabe, T.: "Extracting a Planar Spanning Subgraph of a Terminal-Vertex Graph by Solving the Independent Set Problem"Proc.2001 IEEE International Symposium on Circuit and Systems(ISCAS 2001). V-153-V-156 (2001)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 高藤 大介, 岡田 誠, 渡邉 敏正: "グラフの付加辺多重度に上限を持つk辺連結化問題"信学技報,COMP98-1. 1-8 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Taoka, S., Watanabe, T.: "The k-Edge-Connectivity Augmentation Problem without adding multiple edges of a Graph"Tech.Rep.of IEICE,COMP98-2. 9-16 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M., Hashimoto, M., Watanabe, T.: "A Heuristic Algorithm FSD for the Legal Firing Sequence Problem of Petri Nets"Tech.Rep.of IEICE,COMP98-6. 41-48 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M., Watanabe, T.: "Extracting Siphons Containing a Specified Set of Places in a Petri Net"Tech.Rep.of IEICE,CST98-11. 1-8 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 岩本 道尚, 田岡 智志, 渡邉 敏正: "サイクリックカクタスに対する発火系列問題の解法について"信学技報,CST98-25. 49-56 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M., Shiba, S., Watanabe, T.: "A Heuristic Algorithm SDS for Scheduling with Timed Petri Nets"Tech.Rep.of IEICE,CAS98-58. 57-64 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 岩本 道尚, 藤戸 敏弘, 田岡 智志, 渡邉 敏正: "枝重み付きカクタスに対する発火系列問題の解法"信学技報,CST98-32. 23-30 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 竹下 和彦, 藤戸 敏弘, 渡邉 敏正: "いくつかのハイパーグラフ問題に対するPrimal-Dual近似アルゴリズムについて"情処研報,99-MPS-23-3. 13-18 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 和久田 真浩, 田岡 智志, 渡邉 敏正: "ペトリネットのサイフォン・トラップサポート集合に基づくインバリアント算出法"信学技報,CST99-2. 9-16 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 阿波 賢, 田岡 智志, 渡邉 敏正: "ペトリネットにおけるトークン数下限制約を持つ発火系列問題"信学技報,CST99-3. 17-24 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Wakuda, M., Yamauchi, M., Taoka, S., Watanabe, T.: "A Fast and Space-Saving Algorithm FMSN for Computing Petri Net Invariants with Supports Containing All Specified Nodes"Tech.Rep.of IEICE,CST99-16. 37-44 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakai, T., Yamauchi, M., Takafuji, D., Watanabe, T.: "A New Heuristic Algorithm FSDT for the Legal Firing Sequence Problem of Petri Nets and Its Application to Solving MAXSAT"Tech.Rep.of IEICE,CST99-33. 1-8 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Takafuji, D., Takeuchi, R., Watanabe, T.: "A Heuristic Algorithm EAM for solving k-Edge-Connectivity Augmentation Problem with Upper Bounds on Edge Multiplicity"Tech.Rep.of IEICE,COMP99-60. 33-40 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mashima, T., Watanabe, T.: "Vertex-connectivity augmentation problems for graphs with degree-unchangeable vertices"Tech.Rep.of IEICE,COMP99-61. 41-48 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 小林 利大, 渡邉 敏正: "層割当てのためのネット集合分割に基づく制約付きビア数最小化手法PNLA"信学技報,VLD99-94. 57-64 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 高藤 大介, 墨川 新平, 渡邉 敏正: "プリント基板設計における非平面接続要求の部品下領域を利用した配線手法"信学技報,VLD99-95. 65-72 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M., Nishiuchi, K., Watanabe, T.: "Improved Implementation of the Fourier-Motzkin Method for Computing Petri Net Invariants"Tech.Rep.of IEICE,CST99-56. 9-16 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakai, T., Yamauchi, M., Watanabe, T.: "A Heuristic Algorithm FSDB for the Maximum Legal Firing Sequence Problem of Petri Nets"Tech.Rep.of IEICE,CST99-57. 17-24 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 高藤 大介, 伊藤 貴史, 田岡 智志, 渡邉 敏正: "CONTEC: 辺交差の制御機能を有するグラフ描画システム"信学技報,COMP99-76. 57-64 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mashima, T., Watanabe, T.: "Solving the 2-,3-vertex-connectivity augmentation problem for specified vertices of a graph with degree-unchangeable ones"Tech.Rep.of IEICE,COMP99-77. 65-72 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Taoka, S., Watanabe, T.: "The(σ+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph"Tech.Rep.of IEICE,COMP99-78. 73-80 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mashima, T., Watanabe, T.: "A Linear Time Algorithm for the 3-Vertex-Connectivity Augmentation Problem for Specified Vertices of a Graph with Degree-Unchangeable Ones"Tech.Rep.of IEICE,COMP2000-3. 17-24 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Awa, K., Taoka, S., Watanabe, T.: "Heuristic Algorithms for the Legal Firing Sequence and Related Problems of Petri Nets"Tech.Rep.of IEICE,CST2000-8. 57-64 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nishi, S., Taoka, S., Watanabe, T.: "A New Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets"Tech.Rep.of IEICE,CST2000-8. 57-64 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mashima, T., Watanabe, T.: "A Linear Time Algorithm for the 3-Edge-Connectivity Augmentation Problem for Specified Vertices of a Graph with Degree-Unchangeable Ones"Tech.Rep.of IEICE,COMP2000-30. 25-32 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 高野 勝史, 田岡 智志, 渡邉 敏正: "Fourier-Motzkin法によるペトリネットインバリアント計算の効率化"信学技報,CST2000-12. 9-16 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Taoka, S., Watanabe, T.: "An Efficient Algorithm for Constructing(σ+1)-Edge-Connected Simple Graphs by Edge Addition"Tech.Rep.of IEICE,CAS2000-68. 51-58 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 黒瀬 康弘, 岡本 敏之, 田岡 智志, 渡邉 敏正: "通信ネットワークの(σ+1)辺連結化問題に対する効率的分散アルゴリズムDECA-1"信学技報,CST2000-62. 9-14 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamaoki, T., Taoka, S., Watanabe, T.: "Extracting a Planar Spanning Subgraph of a Terminal-Vertex Graph solving the Independent Set Problem"Tech.Rep.of IEICE,COMP2000-52. 17-24 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 田岡 智志, 渡邉 敏正: "通信ネットワークの3辺連結化分散アルゴリズム3DECA"信学技報,CST2000-35. 15-22 (2001)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 渡邉 敏正: "データ構造と基本アルゴリズム"共立出版株式会社. (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Takahashi, K. and Watanabe, T.: "A Heuristic Algorithm to Solve Constrained via Minimization for Three-Layer Routing Problems"Proc. 1998 IEEE International Symposium on Circuits and Systems. Vol.6. VI254-VI257 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M. and Watanabe, T.: "A Heuristic Algorithm FSD for the Legal Firing Sequence Problem of Petri Nets"Proc. 1998 IEEE International Conference on Systems, Man and Cybernetics (SMC 98). 78-83 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M. , Tanimoto, S. and Watanabe, T.: "Extracting Siphons Containing a Specified Set of Places in a Petri Net"Proc. 1998 IEEE International Conference on Systems, Man and Cybernetics (SMC 98). 142-147 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Fujito, T. , Taoka, S. , and Watanabe, T.: "On the Legal Firing Sequence Problem of Petri Nets with Cactus Structure"Proc. 12th Karuizawa Workshop on Circuits and Systems, IEICE of Japan. 213-218 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Takafuji, D. , and Watanabe, T.: "Minimum Augmentation to Construct a 4-Edge-Connected Simple Graph"Proc. 12th Karuizawa Workshop on Circuits and Systems, IEICE of Japan. 487-492 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mizuno, K. , Kobayashi, T. and Watanabe, T.: "Extracting Nonplanar Connections in a Terminal-Vertex Graph"Proc. 1999 IEEE International Symposium on Circuit and Systems (ISCAS'99). VI-121-VI-124 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M. and Watanabe, T.: "A Heuristic Algorithm SDS for Scheduling with Timed Petri Nets"Proc. 1999 IEEE International Symposium on Circuit and Systems (ISCAS '99). VI-81-VI-84 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M., Wakuda, M., Taoka. S. and Watanabe, T.: "A Fast and Space-Saving Algorithm for Computing Invariants of Petri Nets"Proc. 1999 IEEE International Conference on Systems, Man and Cybernetics (SMC 99). I-866-I-871 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Taoka, S. and Watanabe, T.: "A Linear Time Algorithm Solving the Legal Firing Sequence Problem for a Class of Edge-Weighted Cactuses"Proc. 1999 IEEE International Conference on Systems, Man and Cybernetics (SMC 99). III-893-III-898 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M. and Watanabe, T.: "Time Complexity Analysis of the Minimal Siphon Extraction Problem of Petri Nets"IEICE Trans. Fundamentals. Vol.E82-A, No.11. 2558-2565 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M. and Watanabe, T.: "Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net"IEICE Trans. Fundamentals. Vol.E82-A, No.11. 2566-2575 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Fujito, T. , Taoka, S. and Watanabe, T.: "On the Legal Firing Sequence Problem of Petri Nets with Cactus Structure"IEICE Trans. Fundamentals. Vol.E83-A, No.3. 480-486 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nishi, S. , Taoka, S. and Watanabe, T.: "A Heuristic Algorithm FMD for the Minimum Initial Marking Problem of Petri Nets"Proc. 13th Karuizawa Workshop on Circuits and Systems, IEICE of Japan. 275-280 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mashima, T. and Watanabe, T.: "Graph Augmentation Problems with Degree-Unchangeable Vertices"Proc. 13th Karuizawa Workshop on Circuits and Systems, IEICE of Japan. 167-172 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Takafuji, D. , Taoka, S. and Watanabe, T.: "k-Edge-Connectivity Augmentation Problem with Upper Bounds on Edge Multiplicity"Proc. 2000 IEEE International Symposium on Circuit and Systems (ISCAS 2000). IV-601-IV-604 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Taoka, S. and Watanabe, T.: "The (σ+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph"Lecture Notes in Computer Science 1872, Theoretical Computer Science, Springer-Verlag, Berlin. 169-185 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nishi, S. , Taoka, S. and Watanabe, T.: "A New Heuristic Method for Solving the Minimum Initial Marking Problem of Petri Nets"Proc. 2000 IEEE International Conference on Systems, Man, and Cybernetics. 3218-3223 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nishi, S. , Taoka, S. and Watanabe, T.: "A Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets"IEICE Trans. Fundamentals. Vol.E84-A, No.3. 771-780 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mashima, T. and Watanabe, T.: "Graph Augmentation Problems with Degree-Unchangeable Vertices"IEICE Trans. Fundamentals. Vol.E84-A, No.3. 781-793 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamaoki, T. , Taoka, S. and Watanabe, T.: "Extracting a Planar Spanning Subgraph of a Terminal-Vertex Graph by Solving the Independent Set Problem"Proc. 2001 IEEE International Symposium on Circuit and Systems (ISCAS 2001). V-153-V-156 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Takafuji, D. , Okada, M. and Watanabe, T.: "K-Edge-Connectivity Augmentation of a Graph with Upper Bounds on the Multiplicity of Added Edges"Tech. Rep. of IEICE, COMP98-1. 1-8 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Taoka, S. and Watanabe, T.: "The k-Edge-Connectivity Augmentation Problem without adding multiple edges of a Graph"Tech. Rep. of IEICE, COMP98-2. 9-16 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M. , Hashimoto, M. and Watanabe, T.: "A Heuristic Algorithm FSD for the Legal Firing Sequence Problem of Petri Nets"Tech. Rep. of IEICE, COMP98-6. 41-48 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M. and Watanabe, T.: "Extracting Siphons Containing a Specified Set of Places in a Petri Net"Tech. Rep. of IEICE, CST98-11. 1-8 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Iwamoto, M. , Taoka, S. , and Watanabe, T.: "The Legal Firing Sequence Problem for Cyclic Cactuses"Tech. Rep. of IEICE, CST98-25. 49-56 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M. , Shiba, S. and Watanabe, T.: "A Heuristic Algorithm SDS for Scheduling with Timed Petri Nets"Tech. Rep. of IEICE, CAS98-58. 57-64 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Iwamoto, M. , Fujito, T. , Taoka, S. and Watanabe, T.: "Solving the Legal Firing Sequence Problem for Edge-weighted Cactuses"Tech. Rep. of IEICE, CST98-32. 23-30 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Takeshita, K. , Fujito, T. and Watanabe, T.: "On Primal-Dual Approximation Algorithms for Several Hypergraph Problems"IPSJ Notes. 99-MPS-23-3. 13-18 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Wakuda, M. , Taoka, S. and Watanabe, T.: "Computing Petri Net Invariants based on Siphon-Trap Supports"Tech. Rep. of IEICE, CST99-2. 9-16 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Awa, K. Taoka, S. and Watanabe, T.: "The Legal Firing Sequence Problem of Petri Nets with Lower Bounds on the Number of Tokens"Tech. Rep. of IEICE, CST99-3. 17-24 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Wakuda, M. , Yamauchi, M. , Taoka, S. and Watanabe, T.: "A Fast and Space-Saving Algorithm FMSN for Computing Petri Net Invariants with Supports Containing A11 Specified Nodes"Tech. Rep. of IEICE, CST99-16. 37-44 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakai, T. , Yamauchi, M. , Takafuji, D. and Watanabe, T.: "A New Heuristic Algorithm FSDT for the Legal Firing Sequence Problem of Petri Nets and Its Application to Solving MAXSAT"Tech. Rep. of IEICE, CST99-33. 1-8 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Takafuji, D. , Takeuchi, R. and Watanabe, T.: "A Heuristic Algorithm EAM for solving k-Edge-Connectivity Augmentation Problem with Upper Bounds on Edge Multiplicity"Tech. Rep. of IEICE, COMP99-60. 33-40 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mashima, T. and Watanabe, T.: "Vertex-connectivity augmentation problems for graphs with degree-unchangeable vertices"Tech. Rep. of IEICE. COMP99-61. 41-48 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Kobayashi, T. and Watanabe, T.: "Constrained Via Minimization Algorithm PNLA based on Partitioning a Set of Nets for Layer Assignment"Tech. Rep. of IEICE, VLD99-94. 57-64 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Takafuji, D. , Sumikawa, S. and Watanabe, T.: "Heuristic Algorithms for Routing Nonplanar Connections through Areas under Elements in Printed Wiring Board Design"Tech. Rep. of IEICE, VLD99-95. 65-72 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamauchi, M. , Nishiuchi, K. and Watanabe, T.: "Improved Implementation of the Fourier-Motzkin Method for Computing Petri Net Invariants"Tech. Rep. of IEICE, CST99-56. 9-16 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakai, T. , Yamauchi, M. and Watanabe, T.: "A Heuristic Algorithm FSDB for the Maximum Legal Firing Sequence Problem of Petri Nets"Tech. Rep. of IEICE, CST99-57. 17-24 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Takafuji, D. , Itoh, T. , Taoka, S. and Watanabe, T.: "CONTEC : a Graph Drawing System with Edge Crossing Control"Tech. Rep. of IEICE, COMP99-76. 57-64 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mashima, T. and Watanabe, T.: "Solving the 2-, 3-vertex-connectivity augmentation problem for specified vertices of a graph with degree-unchangeable ones"Tech. Rep. of IEICE, COMP99-77. 65-72 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Taoka, S. and Watanabe, T.: "The (σ+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph"Tech. Rep. of IEICE, COMP99-78. 73-80 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mashima, T. and Watanabe, T.: "A Linear Time Algorithm for the 3-Vertex-Connectivity Augmentation Problem for Specified Vertices of a Graph with Degree-Unchangeable Ones"Tech. Rep. of IEICE, COMP2000-3. 17-24 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Awa, K. , Taoka, S. and Watanabe, T.: "Heuristic Algorithms for the Legal Firing Sequence and Related Problems of Petri Nets"Tech. Rep. of IEICE, CST2000-8. 57-64 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nishi, S. , Taoka, S. and Watanabe, T.: "A New Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets"Tech. Rep. of IEICE, CST2000-8. 57-64 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mashima, T. and Watanabe, T.: "A Linear Time Algorithm for the 3-Edge-Connectivity Augmentation Problem for Specified Vertices of a Graph with Degree-Unchangeable Ones"Tech. Rep. of IEICE, COMP2000-30. 25-32 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Takano, K. , Taoka, S. and Watanabe, T.: "Efficient calculation of Petri Net Invariants by the Fourier-Motzkin Method"Tech. Rep. of IEICE, CST2000-12. 9-16 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Taoka, S. and Watanabe, T.: "An Efficient Algorithm for Constructing (σ+1)-Edge-Connected Simple Graphs by Edge Addition"Tech. Rep. of IEICE, CAS2000-68. 51-58 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Kurose, Y. , Okamoto, T. , Taoka, S. and Watanabe, T.: "An Efficient Distributed Algorithm DECA-1 for the (σ+1)-Edge-Connectivity Augmentation Problem of Communication Networks"Tech. Rep. of IEICE, CST2000-62. 9-14 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yamaoki, T. , Taoka, S. and Watanabe, T.: "Extracting a Planar Spanning Subgraph of a Terminal-Vertex Graph by solving the Independent Set Problem"Tech. Rep. of IEICE, COMP2000-52. 17-24 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Taoka, S. and Watanabe, T.: "A Distributed Algorithm 3DECA for the 3-Edge-Connectivity Augmentation Problem of Communication Networks"Tech. Rep. of IEICE, CST2000-35. 15-22 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Toshihiro Fujito: "On the Legal Firing Sequence Problem of Petri Nets with Cactus Structure"IEICE Trans.Fundamentals. E83-A・3. 480-486 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Shin' ichiro Nishi: "A Heuristic Algorithm FMD for the Minimum Initial Marking Problem of Petri Nets"Proc.13th Karuizawa Workshop on Circuits and Systems, IEICE of Japan. 275-280 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Toshiya Mashima: "Graph Augmentation Problems with Degree-Unchangeable Vertices"Proc.13th Karuizawa Workshop on Circuits and Systems, IEICE of Japan. 167-172 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Daisuke Takafuji: "κ-Edge-Connectivity Augmentation Problem with Upper Bounds on Edge Multiplicity"Proc.2000 IEEE International Symposium on Circuit and Systems (ISCAS 2000). IV-601-IV-604 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Satoshi Taoka: "The (σ+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph"Lecture Notes in Computer Science 1872, Theoretical Computer Science, Springer-Verlag, Berlin. 169-185 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Shin' ichiro Nishi: "A New Heuristic Method for Solving the Minimum Initial Marking Problem of Petri Nets"Proc.2000 IEEE International Conference on Systems, Man, and Cybernetics. 3218-3223 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Shin' ichiro Nishi: "A Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets"IEICE Trans.Fundamentals. E84-A・3(掲載予定). (2001)

    • Related Report
      2000 Annual Research Report
  • [Publications] Toshiya Mashima: "Graph Augmentation Problems with Degree-Unchangeable Vertices"IEICE Trans.Fundamentals. E84-A・3(掲載予定). (2001)

    • Related Report
      2000 Annual Research Report
  • [Publications] Tsutomu Yamaoki: "Extracting a Planar Spanning Subgraph of a Terminal-Vertex Graph by Solving the Independent Set Problem"Proc.2001 IEEE International Symposium on Circuit and Systems (ISCAS 2001). (2001)

    • Related Report
      2000 Annual Research Report
  • [Publications] Toshiya Mashima: "A Linear Time Algorithm for the 3-Vertex-Connectivity Augmentation Problem for Specified Vertices of a Graph with Degree-Unchangeable Ones"電子情報通信学会技術研究報告. COMP2000-3. 17-24 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Ken Awa: "Heuristic Algorithms for the Legal Firing Sequence and Related Problems of Petri Nets"電子情報通信学会技術研究報告. CST2000-8. 57-64 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Shin' ichiro Nishi: "A New Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets"電子情報通信学会技術研究報告. CST2000-8. 57-64 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Toshiya Mashima: "A Linear Time Algorithm for the 3-Edge-Connectivity Augmentation Problem for Specified Vertices of a Graph with Degree-Unchangeable Ones"電子情報通信学会技術研究報告. COMP2000-30. 25-32 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] 高野勝史: "Fourier-Motzkin法によるペトリネットインバリアント計算の効率化"電子情報通信学会技術研究報告. CST2000-12. 9-16 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Satoshi Taoka: "An Efficient Algorithm for Constructing (σ+1)-Edge-Connected Simple Graphs by Edge Addition"電子情報通信学会技術研究報告. CAS2000-68. 51-58 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] 黒瀬康弘: "通信ネットワークの(σ+1)辺連結化問題に対する効率的分散アルゴリズムDECA-1"電子情報通信学会技術研究報告. CST2000-62. 9-14 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Tsutomu Yamaoki: "Extracting a Planar Spanning Subgraph of a Terminal-Vertex Graph by solving the Independent Set Problem"電子情報通信学会技術研究報告. COMP2000-52. 17-24 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] 田岡智志: "通信ネットワークの3辺連結化分散アルゴリズム3DECA"電子情報通信学会技術研究報告. CST2000-35. 15-22 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] 渡邉敏正: "データ構造と基本アルゴリズム"共立出版株式会社. 286 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Kenji Mizuno: "Extracting Nonplanar Connections in a Terminal-Vertex Graph"Proc.1999 IEEE International Symposium on Circuit and Systems (ISCAS'99). VI-121-VI-124 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Masahiro Yamauchi: "A Heuristic Algorithm SDS for Scheduling with Timed Petri Nets"Proc.1999 IEEE International Symposium on Circuit and Systems (ISCAS'99). VI-81-VI-84 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Masahiro Yamauchi: "A Fast and Space-Saving Algorithm for Computing Invariants of Petri Nets"Proc.1999 IEEE International Conference on Systems, Man and Cybernetics (SMC99). I-866-I-871 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Satoshi Taoka: "A Linear Time Algorithm Solving the Legal Firing Sequence Problem for a Class of Edge-Weighted Cactuses"Proc.1999 IEEE International Conference on Systems, Man and Cybernetics (SMC99). III-893-III-898 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Masahiro Yamauchi: "Time Complexity Analysis of the Minimal Siphon Extraction Problem of Petri Nets"IEICE Trans.Fundamentals. E82-A・11. 2558-2565 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Masahiro Yamauchi: "Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net"IEICE Trans.Fundamentals. E82-A・11. 2566-2575 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] 藤戸敏弘: "カクタス構造のペトリネットにおける発火系列問題について"第12回回路とシステム(軽井沢)ワークショップ論文集. 213-218 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] 高藤大介: "4辺連結単純グラフの最小構成法"第12回回路とシステム(軽井沢)ワークショップ論文集. 487-492 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] 和久田真浩: "ペトリネットのサイフォン・トラップサポート集合に基づくインバリアント算出法"電子情報通信学会技術研究報告. CST99-2. 9-16 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] 阿波賢: "ペトリネットにおけるトークン数下限制約を持つ発火系列問題"電子情報通信学会技術研究報告. CST99-3. 17-24 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Masahiro Wakuda: "A Fast and Space-Saving Algorithm FMSN for Computing Petri Net Invariants with Supports Containing All Specified Nodes"IEICE Technical Report. CST99-16. 37-44 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Takahiro Nakai: "A New Heuristic Algorithm FSDT for the Legal Firing Sequence Problem of Petri Nets and Its Application to Solving MAX SAT"IEICE Technical Report. CST99-33. 1-8 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Daisuke Takafuji: "A Heuristic Algorithm EAM for solving k-Edge-Connectivity Augmentation Problem with Upper Bounds on Edge Multiplicity"IEICE Technical Report. COMP99-60. 33-40 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Toshiya Mashima: "Vertex-connectivity augmentation problems for graphs with degree-unchangeable ver-tices"IEICE Technical Report. COMP99-61. 41-48 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] 小林利大: "層割当てのためのネット集合分割に基づく制約付きビア数最小化手法PNLA"電子情報通信学会技術研究報告. VLD99-94. 57-64 (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] 高藤大介: "プリント基板設計における非平面接続要求の部品下領域を利用した配線手法"電子情報通信学会技術研究報告. VLD99-95. 65-72 (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] Masahiro Yamauchi: "Improved Implementation of the Fourier-Motzkin Method for Computing Petri Net Invariants"Tech.Rep.of IEICE. CST99-56. 9-16 (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] Takahiro Nakai: "A Heuristic Algorithm FSDB for the Maximum Legal Firing Sequence Problem of Petri Nets"Tec.Rep.of IEICE. CST99-57. 17-24 (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] 高藤大介: "CONTEC:辺交差の制御機能を有するグラフ描画システム"電子情報通信学会技術研究報告. COMP99-76. 57-64 (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] Toshiya Mashima: "Solving the 2-,3-vertex-connectivity augmentation problem for specified vertices of a graph with degree-unchangeable ones"Tech.Rep.of IEICE. COMP99-77. 65-72 (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] Satoshi Taoka: "The (σ+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph"Tech.Rep.of IEICE. COMP99-78. 73-80 (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] 渡邉敏正: "データ構造と基本アルゴリズム"共立出版株式会社. 286 (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] Kazuhiro Takahashi: "A Heuristic Algorithm to Solve Constrained via Minimization for Three-Layer Routing Problems" Proc.1998 IEEE International Symposium on Circuits and Systems. Vol.6. VI254-VI257 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] Masahiro Yamauchi: "A Heuristic Algorithm FSD for the Legal Firing Sequence Problem of Petri Nets" Proc.1998 IEEE International Conference on Systems,Man and Cybernetics(SMC98). 78-83 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] Masahiro Yamauchi: "Extracting Siphons Containing a Specified Set of Places in a Petri Net" Proc.1998 IEEE International Conference on Systems,Man and Cybernetics(SMC98). 142-147 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] Masahiro Yamauchi: "A Heuristic Algorithm SDS for Scheduling with Timed Petri Nets" Proc.1999 IEEE International Conference on Circuit and Systems(ISCAS´99). (1999)

    • Related Report
      1998 Annual Research Report
  • [Publications] Kenji Mizuno: "Extracting Nonplanar Connections in a Terminal-Vertex Graph" Proc.1999 IEEE International Conference on Circuit and Systems(ISCAS´99). (1999)

    • Related Report
      1998 Annual Research Report
  • [Publications] 高藤 大介: "グラフの付加辺多重度に上限を持つ k-辺連結化問題" 電子情報通信学会技術研究報告. COMP98-1. 1-8 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] Satoshi Taoka: "The k-Edge-Connectivity Augmentation Problem without adding multiple edges of a Graph" IEICE Technical Report. COMP98-2. 9-16 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] Masahiro Yamauchi: "A Heuristic Algorithm FSD for the Legal Firing Sequence Problem of Petri Nets" IEICE Technical Report. COMP98-6. 41-48 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] Masahiro Yamauchi: "Extracting Siphons Containing aSpecified Set of Places in a Petri Net" IEICE Technical Report. CST98-11. 1-8 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] 岩本 道尚: "サイクリックカクタスに対する発火系列問題の解法について" 電子情報通信学会技術研究報告. CST98-25. 49-56 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] Masahiro Yamauchi: "A Heuristic Algorithm SDS for Scheduling with Timed Petri Nets" IEICE Technical Report. CAS98-58. 57-64 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] 岩本 道尚: "枝重み付きカクタスに対する発火系列問題の解法" 電子情報通信学会技術研究報告. CST98-32. 23-30 (1999)

    • Related Report
      1998 Annual Research Report
  • [Publications] 竹下 和彦: "いくつかのハイパーグラフ問題に対するPrimal-Dual近似アルゴリズムについて" 情報処理学会研究報告. 99-MPS-23-3. 13-18 (1999)

    • Related Report
      1998 Annual Research Report

URL: 

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

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi