O(N2.5) TIME ALGORITHMS FOR THE SUBGRAPH HOMEOMORPHISM PROBLEM ON TREES

被引：40

作者：

CHUNG, MJ ^{[1
]}

机构：

[1] RENSSELAER POLYTECH INST,DEPT COMP SCI,TROY,NY 12181

来源：

关键词：

D O I：

10.1016/0196-6774(87)90030-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：106 / 112

页数：7

共 7 条

[1] THE DIRECTED SUBGRAPH HOMEOMORPHISM PROBLEM [J].

FORTUNE, S ;

HOPCROFT, J ;

WYLLIE, J .

[2]

Garey MR., 1979, COMPUTERS INTRACTABI

[3]

Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P225, DOI 10.1137/0202019

[4]

LAPAUGH A, 1978, 10TH P STOC, P40

[5] ANALYSIS OF A GOOD ALGORITHM FOR SUBTREE PROBLEM [J].

REYNER, SW .

[6]

SHILOAH Y, STANCS78654 STANF U

[7]

VALDES J, UNPUB SUBTREE HOMEOM