首页 /研究 /A SimpleO(logN) Time Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs
OTHER

A SimpleO(logN) Time Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs

Srabani Sen Gupta, Bhabani P. Sinha

发表年份
1999
引用次数
10

关键词

Adjacency listIsomorphism (crystallography)Computer scienceHypercubeCombinatoricsPathwidthAlgorithmChordal graphParallel algorithmTime complexity

相关论文

查看 OTHER 分类全部论文