Survivable Network Design Problems with Weighted Degree Constraints (Combinatorial Optimization and Discrete Algorithms)

スポンサーリンク

概要

• 論文の詳細を見る
• 京都大学の論文

著者

• Fukunaga Takuro

  Graduate School Of Informatics Kyoto University

• Nagamochi Hiroshi

  Graduate School Of Informatics Kyoto University

関連論文

• Constant Time Generation of Trees with Degree Bounds
• Constant Time Generation of Trees with Degree Bounds
• Enumerating Colored and Rooted Outerplanar Graphs
• Survivable Network Design Problems with Weighted Degree Constraints (Combinatorial Optimization and Discrete Algorithms)
• Contention-Free λ-Planes in Optically Burst-Switched WDM Networks(Internet)
• The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights
• Accelerating A* algorithms by sweeping out small-degree nodes
• Indexing All Rooted Subgraphs of a Rooted Graph

スポンサーリンク