Fast algorithms for K4 immersion testing

被引:9
作者
Booth, HD [1 ]
Govindan, R
Langston, MA
Ramachandramurthi, S
机构
[1] Univ Tennessee, Dept Comp Sci, Knoxville, TN 37996 USA
[2] Qualcomm Inc, San Diego, CA 92121 USA
[3] LSI Log Corp, Waltham, MA 02451 USA
基金
美国国家科学基金会;
关键词
D O I
10.1006/jagm.1998.0991
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Many useful classes of graphs can in principle be recognized with finite batteries of obstruction tests. One of the most fundamental tests is to determine whether an arbitrary input graph contains K-4 in the immersion order. In this paper, we present for the first time a fast, practical algorithm to accomplish this task. We also extend our method so that, should an immersed K-4 be present, a K-4 model is isolated. (C) 1999 Academic Press.
引用
收藏
页码:344 / 378
页数:35
相关论文
共 21 条