Parallel algorithm for testing isomorphism of undirected graphs

被引：0

作者：

Chen, Ling

Yin, Xinchun

机构：

来源：

Jisuanji Gongcheng/Computer Engineering | 2002年 / 28卷 / 06期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

下载

共 50 条

[41] ISOMORPHISM TESTING FOR GRAPHS EXCLUDING SMALL MINORS
Grohe, M. A. R. T. I. N.
Neuen, D. A. N. I. E. L.
Wiebking, D. A. N. I. E. L.
SIAM JOURNAL ON COMPUTING, 2023, 52 (01) : 238 - 272
[42] Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs
Baswanass, Surender
Khans, Shahbaz
AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 138 - 149
[43] Nearly Work-Efficient Parallel DFS in Undirected Graphs
Ghaffari, Mohsen
Grunau, Christoph
Qu, Jiahao
PROCEEDINGS OF THE 35TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2023, 2023, : 273 - 283
[44] Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs
Khan, Shahbaz
ACM TRANSACTIONS ON PARALLEL COMPUTING, 2019, 6 (03)
[45] Planar graphs: Logical complexity and parallel isomorphism tests
Verbitsky, Oleg
STACS 2007, PROCEEDINGS, 2007, 4393 : 682 - 693
[46] EFFICIENT ALGORITHM FOR DETERMINING ISOMORPHISM OF TWO GRAPHS
SAUCIER, G
REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1971, 5 (NR3): : 39 - 51
[47] ALGORITHM TO FIND ISOMORPHISM TO FINITE AND CONNECTED GRAPHS
BAUERSFELD, G
ESSMANN, C
LOHLE, H
COMPUTING, 1973, 11 (02) : 159 - 168
[48] Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs
Baswana, Surender
Khan, Shahbaz
ALGORITHMICA, 2017, 79 (02) : 466 - 483
[49] A CYCLE GENERATION ALGORITHM FOR FINITE UNDIRECTED LINEAR GRAPHS
GIBBS, NE
JOURNAL OF THE ACM, 1969, 16 (04) : 564 - &
[50] Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs
Khan, Shahbaz
PROCEEDINGS OF THE 29TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA'17), 2017, : 283 - 292

← 1 2 3 4 5 →