.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
In this paper, we explore some properties of identification matrices and exhibit some uses of identification matrices in studying the graph isomorphism problem, a famous open problem. We show that, given two graphs in the form of a certain identification matrix, isomorphism can be tested efficiently in parallel if at least one matrix satisfies the circular is property, and more efficiently in parallel ii at least one matrix satisfies the consecutive Is property. Graphs which have identification matrices satisfying the consecutive Is property include, among others, proper interval graphs and doubly convex bipartite graphs. The result presented here substantially broadens the class of graphs for which there are known efficient parallel isomorphism testing algorithms.
Keyword:
consecutive and circular is properties
graph isomorphism testing
identification matrices
parallel algorithms
PRAM
time and processor requirements
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享.png){kind=icon}
收藏Psychiatric Sequelae Following Breast Cancer Chemotherapy: A Pilot Study Using Claims Data乳腺癌化疗后的精神病后遗症: 一项使用索赔数据的初步研究.png)
OAAI
OAAI分享收藏Characterization of the quinones in purple sulfur bacterium Thermochromatium tepidum.png)
FEBS LettersOAAI
FEBS LettersIF0
OAAI分享收藏
分享收藏
查看更多内容