SUBGRAPH ISOMORPHISM FOR BICONNECTED OUTERPLANAR GRAPHS IN CUBIC TIME

被引：0

|

作者：

LINGAS, A

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1986年 / 210卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：98 / 103

页数：6

相关论文

共 50 条

[41] A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree
Akutsu, Tatsuya
Tamura, Takeyuki
ALGORITHMS, 2013, 6 (01) : 119 - 135
[42] RECOGNIZING OUTERPLANAR GRAPHS IN LINEAR TIME
WIEGERS, M
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 246 : 165 - 176
[43] On the isomorphism problem for a family of cubic metacirculant graphs
Tan, ND
DISCRETE MATHEMATICS, 1996, 151 (1-3) : 231 - 242
[44] FAST PARALLEL ALGORITHMS FOR THE SUBGRAPH HOMEOMORPHISM AND THE SUBGRAPH ISOMORPHISM-PROBLEM FOR CLASSES OF PLANAR GRAPHS
LINGAS, A
PROSKUROWSKI, A
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 287 : 79 - 94
[45] A POLYNOMIAL-TIME ALGORITHM FOR SUBGRAPH ISOMORPHISM OF 2-CONNECTED SERIES-PARALLEL GRAPHS
LINGAS, A
SYSLO, MM
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 317 : 394 - 409
[46] SYNTHESIS OF BICONNECTED GRAPHS
BOESCH, FT
MCHUGH, JAM
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1974, CA21 (03): : 330 - 334
[47] First-Order Complexity of Subgraph Isomorphism via Kneser Graphs
V. A. Voronov
E. A. Dergachev
M. E. Zhukovskii
A. M. Neopryatnaya
Mathematical Notes, 2021, 109 : 29 - 37
[48] First-Order Complexity of Subgraph Isomorphism via Kneser Graphs
Voronov, V. A.
Dergachev, E. A.
Zhukovskii, M. E.
Neopryatnaya, A. M.
MATHEMATICAL NOTES, 2021, 109 (1-2) : 29 - 37
[49] Constant Time Generation of Biconnected Rooted Plane Graphs
Zhuang, Bingbing
Nagamochi, Hiroshi
FRONTIERS IN ALGORITHMICS, 2010, 6213 : 113 - 123
[50] SOLVING THE EUCLIDEAN BOTTLENECK BICONNECTED EDGE SUBGRAPH PROBLEM BY 2-RELATIVE NEIGHBORHOOD GRAPHS
CHANG, MS
TANG, CY
LEE, RCT
DISCRETE APPLIED MATHEMATICS, 1992, 39 (01) : 1 - 12

← 1 2 3 4 5 →