Testing bandwidth k for k-connected graphs

被引：0
|
作者：
Engel, K [1 ]
Guttmann, S
机构：
[1] Univ Rostock, Fachbereich Math, D-18051 Rostock, Germany
[2] Arvato Syst GmbH, D-33311 Gutersloh, Germany
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 2003年 / 16卷 / 02期
关键词：
bandwidth; bandwidth-k graph; k-connected graph; linear-time algorithm; linear layout; start sequence;
D O I：
10.1137/S0895480199351148
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：301 / 312
页数：12
相关论文
共 50 条
12345