Approximating the path-distance-width for $k$-cocomparability graphs (Mathematical Foundations and Applications of Computer Science and Algorithms)

HANDLE Web Site Open Access
  • Otachi, Yota
    Graduate School of Information Sciences, Tohoku University
  • Saitoh, Toshiki
    ERATO MINATO Discrete Structure Manipulation System Project, Japan Science and Technology Agency
  • Yamanaka, Katsuhisa
    Graduate School of Information Systems, University of Electro Communications
  • Kijima, Shuji
    Graduate School of Information Science and Electrical Engineering, Kyushu University
  • Okamoto, Yoshio
    Center for Graduate Education Initiative, JAIST
  • Ono, Hirotaka
    Department of Economic Engineering, Kyushu University
  • Uno, Yushi
    Department of Mathematics and Information Sciences, Graduate School of Science, Osaka Prefecture University
  • Yamazaki, Koichi
    Department of Computer Science, Gunma University

Bibliographic Information

Other Title
  • Approximating the path-distance-width for κ-cocompmability graphs
  • Approximating the path distance width for k cocompmability graphs

Search this article

Journal

Details 詳細情報について

Report a problem

Back to top