Approximating the path-distance-width for $k$-cocomparability graphs (Mathematical Foundations and Applications of Computer Science and Algorithms)
-
- 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
-
- 数理解析研究所講究録
-
数理解析研究所講究録 1744 60-66, 2011-06
京都大学数理解析研究所
- Tweet
Details 詳細情報について
-
- CRID
- 1050845760692131456
-
- NII Article ID
- 110008581434
-
- NII Book ID
- AN00061013
-
- ISSN
- 18802818
-
- HANDLE
- 2433/170971
-
- NDL BIB ID
- 11160441
-
- Text Lang
- en
-
- Article Type
- departmental bulletin paper
-
- Data Source
-
- IRDB
- NDL
- CiNii Articles