Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph

スポンサーリンク

概要

• 論文の詳細を見る
• Springer-Verlagの論文

著者

• Nagamochi H

  Kyoto Univ.

• Ibaraki Toshihide

  School of Science and Technology, Kwansei Gakuin University

• Ibaraki T

  School Of Science And Technology Kwansei Gakuin University

• Ibaraki Toshihide

  Department Of Informatics Kwansei Gakuin University

関連論文

• CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK
• 6B2 AN ITERATED LOCAL SEARCH ALGORITHM FOR THE MULTI-RESOURCE GENERALIZED ASSIGNMENT PROBLEM WITH FLEXIBLE ASSIGNMENT COST(Technical session 6B: General model for scheduling and assignment problem)
• 5B1 A GUIDED LOCAL SEARCH ALGORITHM BASED ON A FAST NEIGHBORHOOD SEARCH FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem)
• Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph
• Multigraph augmentation under biconnectivity and general edge-connectivity requirements
• Optimal augmentation of a 2-vertex-connected multigraph to a k-edge-connected and 3-vertex-connected multigraph
• A Simple Proof of a Minimum Cut Algorithm and Its Applications
• k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
• Augmenting Edge-Connectivity and Vertex-Connectivity Simultaneously
• 4A1 A LOCAL SEARCH ALGORITHM FOR ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW AND TRAVELING TIME CONSTRAINTS(Technical session 4A : Vehicle routing)
• An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns
• INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS

もっと見る 閉じる

スポンサーリンク