Hardness results and an exact exponential algorithm for the spanning tree congestion problem (コンピュテーション)
スポンサーリンク
概要
- 論文の詳細を見る
- 2011-08-30
著者
-
Otachi Yota
Graduate School Of Information Sciences Tohoku University
-
Okamoto Yoshio
Graduate School Of Information Science And Engineering Tokyo Institute Of Technology
-
Uehara Ryuhei
School Of Information Science Jaist
-
Uno Takeaki
National Inst. Of Informatics
-
Uehara Ryuhei
Jaist Ishikawa Jpn
-
OKAMOTO YOSHIO
Center for Graduate Education Initiative, JAIST
-
Okamoto Yoshio
Center For Graduate Education Initiative Jaist
-
Otachi Yota
Tohoku Univ. Sendai Jpn
-
Otachi Yota
Graduate School Of Information Science Tohoku University
-
UEHARA Ryuhei
School of Information Science
関連論文
- Bipartite powers of interval bigraphs
- On the geodesic diameter in polygonal domains (コンピュテーション)
- Enumerating All Rooted Trees Including k Leaves
- A short note on the reducibility of the collapsing knapsack problem
- Spanning tree congestion of k-outerplanar graphs (コンピュテーション)
- Practical Techniques for Speeding Up Enumeration Algorithms for Frequent Itemset Mining Problems
- A TREE PARTITIONING PROBLEM ARISING FROM AN EVACUATION PROBLEM IN TREE DYNAMIC NETWORKS
- AN O(n^2 log^2 n) ALGORITHM FOR INPUT-OR-OUTPUT TEST IN DISJUNCTIVE SCHEDULING
- Generating Chordal Graphs Included in Given Graphs
- Longest Path Problems on Ptolemaic Graphs
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem (コンピュテーション)
- FOREWORD
- Reconstructing sets from distances given by graphs (コンピュテーション)
- The complexity of free flood filling games (コンピュテーション)
- Voronoi Game on a Path
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem (コンピュテーション)
- DS-1-11 An Algorithm for Optimally Locating Baselines using Quad Decomposition
- Enumerating All Rooted Trees Including k Leaves
- NP-completeness of generalized Kaboozle
- Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
- Computational Complexity of Piano-Hinged Dissections
- Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs