On bandwidth-2 graphs
On bandwidth-2 graphs
复制标题
DOI：
10.1016/s0166-218x(01)00196-2
复制
发表时间：
2002-03-15
影响因子：
1.1
通讯作者：
Pretolani, D
中科院分区：
文献类型：
--
作者：
Caprara, A;Malucelli, F;Pretolani, D
我们给出了带宽二图的部分特征，其结构迄今为止被利用的程度非常有限。我们的结果用于推导一种新的线性时间识别算法，该算法比以前已知的算法更容易描述。特别是，我们简短地描述了我们算法的实现。 (C) 2002 Elsevier Science B.V. 保留所有权利。
We give a partial characterization of graphs of bandwidth two, whose structure has been exploited to a very limited extent so far. Our results are used to derive a new linear-time recognition algorithm which is much simpler to describe than the previously known one. In particular, we shortly describe an implementation of our algorithm. (C) 2002 Elsevier Science B.V. All rights reserved.