スポンサーリンク
Graduate School Of Information Sciences Tohoku University. | 論文
- Enumerating All Rooted Trees Including k Leaves
- Hardness and FPT Algorithm for the Rainbow Connectivity of Graphs
- Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
- Approximating the path-distance-width for k-cocomparability graphs
- Algorithm for the Minimum Caterpillar Problem with Terminals
- FPT algorithms for Token Jumping on Graphs