We present a linear-time algorithm to decide whether a given k-connected graph has bandwidth k, where k is a fixed positive integer. This improves the general O(n(k))-time-algorithm of Gurari and Sudborough, based on a dynamic programming approach of Saxe, for the recognition of bandwidth-k graphs on n vertices in the special case of connectivity k.
机构:
Hunan Normal Univ, Dept Math, Changsha, Hunan, Peoples R China
Guangxi Univ, Coll Math & Informat Sci, Nanning, Guangxi, Peoples R ChinaHunan Normal Univ, Dept Math, Changsha, Hunan, Peoples R China
Chen, Xiaodan
Hou, Yaoping
论文数: 0引用数: 0
h-index: 0
机构:
Hunan Normal Univ, Dept Math, Changsha, Hunan, Peoples R ChinaHunan Normal Univ, Dept Math, Changsha, Hunan, Peoples R China
机构:
Xiamen Univ, Sch Math Sci, Xiamen 310065, Peoples R China
Guangxi Teachers Educ Univ, Sch Math Sci, Nanning 530001, Peoples R ChinaXiamen Univ, Sch Math Sci, Xiamen 310065, Peoples R China
Qin, Chengfu
Guo, Xiaofeng
论文数: 0引用数: 0
h-index: 0
机构:
Xiamen Univ, Sch Math Sci, Xiamen 310065, Peoples R ChinaXiamen Univ, Sch Math Sci, Xiamen 310065, Peoples R China
机构:
Univ Electrocommun, Dept Informat & Commun Engn, Chofu, Tokyo 1828585, JapanUniv Electrocommun, Dept Informat & Commun Engn, Chofu, Tokyo 1828585, Japan
Ando, Kiyoshi
Kaneko, Atsushi
论文数: 0引用数: 0
h-index: 0
机构:
Kogakuin Univ, Dept Comp Sci & Commun Engn, Shinjuku Ku, Tokyo 1638677, JapanUniv Electrocommun, Dept Informat & Commun Engn, Chofu, Tokyo 1828585, Japan
Kaneko, Atsushi
Kawarabayashi, Ken-ichi
论文数: 0引用数: 0
h-index: 0
机构:
Natl Inst Informat, Principles Informat Res Div, Chiyoda Ku, Tokyo 1018430, JapanUniv Electrocommun, Dept Informat & Commun Engn, Chofu, Tokyo 1828585, Japan