Approximating the path-distance-width for <i>k</i>-cocomparability graphs
スポンサーリンク
概要
- 論文の詳細を見る
- 一般社団法人情報処理学会の論文
- 2011-02-28
著者
-
Katsuhisa Yamanaka
Graduate School of Information Systems, University of Electro-communications.
-
Yota Otachi
Graduate School of Information Sciences, Tohoku University.
-
Yota Otachi
Graduate School Of Information Sciences Tohoku University.
-
Katsuhisa Yamanaka
Graduate School Of Information Systems University Of Electro-communications.
-
Toshiki Saitoh
Japan Advanced Institute Of Science And Technology
-
Hirotaka Ono
Kyushu University
-
Toshiki Saitoh
Erato Minato Discrete Structure Manipulation System Project Japan Science And Technology Agency.
-
Koichi Yamazaki
Department Of Computer Science Gunma University.
-
Yoshio Okamoto
Center for Graduate Education Initiative, JAIST
-
Shuji Kijima
Graduate School of Information Science and Electrical Engineering, Kyushu University
-
Hirotaka Ono
Department of Economic Engineering, Kyushu University.
-
Yushi Uno
Department of Mathematics and Information Sciences, Graduate School of Science, Osaka Prefecture Uni
-
Shuji Kijima
Graduate School Of Information Science And Electrical Engineering Kyushu University
-
Hirotaka Ono
Department Of Economic Engineering Kyushu University.
-
Yushi Uno
Department Of Mathematics And Information Sciences Graduate School Of Science Osaka Prefecture Unive
-
Yoshio Okamoto
Center For Graduate Education Initiative Jaist
-
Toshiki Saitoh
Graduate School of Engineering, Kobe University
関連論文
- Enumerating All Rooted Trees Including k Leaves
- Graph Orientation Problems for Multiple st-Reachability
- Computational Complexities of University Interview Timetabling
- Random Generation and Enumeration of Proper Interval Graphs
- Efficient Enumeration of All Ladder Lotteries with k Bars
- Efficient Enumeration of All Pseudoline Arrangements
- Online Prediction over Permutahedron
- The Complexity of Free Flood Filling Games
- Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
- Complexity of Minimum Certificate Dispersal Problem with Tree Structure
- A Compact Encoding of Rectangular Drawings with Edge Lengths
- Approximating the path-distance-width for k-cocomparability graphs
- Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
- Coding Ladder Lotteries
- On Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on Three-interaction
- Intersection dimension of bipartite graphs
- (Total) Vector Domination for Graphs with Bounded Branchwidth