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 条
  • [1] Blocks in k-connected graphs
    Karpov D.V.
    Journal of Mathematical Sciences, 2005, 126 (3) : 1167 - 1181
  • [2] Cliques in k-connected graphs
    Obraztsova S.A.
    Journal of Mathematical Sciences, 2007, 145 (3) : 4975 - 4980
  • [3] ON k-DIAMETER OF k-CONNECTED GRAPHS
    Xu Junming Xu Keli of Math.
    AppliedMathematics:AJournalofChineseUniversities, 2001, (03) : 231 - 236
  • [4] On (t,k)-shredders in k-connected graphs
    Nutov, Zeev
    Tsugaki, Masao
    ARS COMBINATORIA, 2007, 83 : 213 - 219
  • [5] Embeddings of k-connected graphs of pathwidth k
    Gupta, A
    Nishimura, N
    Proskurowski, A
    Ragde, P
    ALGORITHM THEORY - SWAT 2000, 2000, 1851 : 111 - 124
  • [6] On k-diameter of k-connected graphs
    Xu J.
    Xu K.
    Applied Mathematics-A Journal of Chinese Universities, 2001, 16 (3) : 231 - 236
  • [7] k-Shredders in k-Connected Graphs
    Egawa, Yoshimi
    JOURNAL OF GRAPH THEORY, 2008, 59 (03) : 239 - 259
  • [8] Embeddings of k-connected graphs of pathwidth k
    Gupta, A
    Nishimura, N
    Proskurowski, A
    Ragde, P
    DISCRETE APPLIED MATHEMATICS, 2005, 145 (02) : 242 - 265
  • [9] Removable edges in a k-connected graph and a construction method for k-connected graphs
    Su, Jianji
    Guo, Xiaofeng
    Xu, Liqiong
    DISCRETE MATHEMATICS, 2009, 309 (10) : 3161 - 3165
  • [10] Sufficient conditions for k-connected graphs and k-leaf-connected graphs
    An, Yonghong
    Zhang, Guizhi
    FILOMAT, 2024, 38 (18) : 6601 - 6608
12345