A Fast Algorithm for (σ+1)-Edge-Connectivity Augmentation of a σ-Edge-Connected Graph with Multipartition Constraints
スポンサーリンク
概要
- 論文の詳細を見る
- 2010-09-22
著者
-
TAOKA Satoshi
Graduate School of Engineering, Hiroshima University
-
Oki Tadachika
Graduate School Of Engineering Hiroshima University
-
WATANABE YOSHIMASA
Graduate School of Engineering, Hiroshima University
関連論文
- Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs(Concurrent Systems,Concurrent/Hybrid Systems: Theory and Applications)
- A Fast Algorithm for (σ+1)-Edge-Connectivity Augmentation of a σ-Edge-Connected Graph with Multipartition Constraints
- A 2-Approximation Algorithm 2-ABIS for 2-Vertex-Connectivity Augmentation of Specified Vertices in a Graph
- A (2 - 2/|L|)-Approximation Algorithm R2VS or R2ES to 2-Vertex- or 2-Edge-Connect Specified Vertices in a Graph
- Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets
- Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets
- Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets(Concurrent/Hybrid Systems : Theory and Applications)
- Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem
- Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs
- Performance Comparison of Algorithms for the Dynamic Shortest Path Problem(Selected Papers from the 19th Workshop on Circuits and Systems in Karuizawa)
- Siphon-Trap-Based Algorithms for Efficiently Computing Petri Net Invariants(Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
- A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints