スポンサーリンク
The Department Of Mathematical Science Faculty Of Integral Arts And Science The University Of Tokush | 論文
- What Structural Features Make Graph Problems to Have Efficient Parallel Algorithms? : Using Outerplanar Graphs, Trapezoid Graphs and In-Tournament Graphs as Examples(Special Issue on Algorithm Engineering : Surveys)
- An Algorithm for Finding Two Edge-Disjoint Paths in Tournaments
- Parallel Algorithms for Finding a Hamiltonian Path and a Hamiltonian Cycle in an In-Tournament Graph(Special Section on Discrete Mathematics and Its Applications)