Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
スポンサーリンク
概要
- 論文の詳細を見る
- 2011-08-30
著者
-
Yota Otachi
Graduate School of Information Sciences, Tohoku University.
-
Yota Otachi
Graduate School Of Information Sciences Tohoku University.
-
Ryuhei Uehara
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Uehara Ryuhei
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Ryuhei Uehara
School Of Information Science Jaist
-
Takeaki Uno
National Institute Of Informatics
-
Yoshio Okamoto
Center for Graduate Education Initiative, JAIST
-
Yoshio Okamoto
Center For Graduate Education Initiative Jaist
関連論文
- Enumerating All Rooted Trees Including k Leaves
- Graph Orientation Problems for Multiple st-Reachability
- Efficient Enumeration of All Pseudoline Arrangements
- The Complexity of Free Flood Filling Games
- Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
- Approximating the path-distance-width for k-cocomparability graphs
- On the number of reduced trees, cographs, and series-parallel graphs by compression
- Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
- NP-completeness of generalized Kaboozle
- Algorithm to Generate All Connected Simple Graphs of Given Order
- Computational Complexity of Piano-Hinged Dissections
- Bumpy Pyramid Folding Problem
- An Algorithm for Finding Frequently Appearing Long String Patterns from Large Scale Databases
- Zipper Unfolding of Domes and Prismoids
- Toward Constant Time Enumeration
- Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs
- Intersection dimension of bipartite graphs
- FPT algorithms for Token Jumping on Graphs
- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid