An Approximation Algorithm for the Hamiltonian Walk Problem on Maximal Planar Graphs (Graphs and Combinatorics III)

スポンサーリンク

概要

• 論文の詳細を見る
• 京都大学の論文

著者

• Nishizeki Takao

  Faculty Of Engineering Tohoku University

• ASANO TAKAO

  Faculty of Engineering, Tohoku University

• WATANABE TAKAHIRO

  R&D Center, Toshiba Corporation

• Asano Takao

  Faculty Of Engineering Tohoku University

• Watanabe Takahiro

  R&d Center Toshiba Corporation

関連論文

• An Approximation Algorithm for the Hamiltonian Walk Problem on Maximal Planar Graphs (Graphs and Combinatorics III)
• A Dynamic Algorithm for Placing Rectangles without Overlapping
• Practical Efficiencies of Planar Point Location Algorithms (Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク