作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

›› 2003, Vol. 29 ›› Issue (13): 108-109.

• 论文 • 上一篇    下一篇

求解连通无向简图的所有连通子图的算法及其应用

胡广朋   

  1. 华东船舶工业学院电子信息学院 镇江 212003
  • 发布日期:2003-07-15

An Algorithm of Seeking All Subgraphs of a Connected Simple Undirected Graph and Its Application

HU Guangpeng   

  1. (School of Electronics and Information, East China Shipbuilding Institute, Zhenjiang 212003)
  • Published:2003-07-15

摘要: 讨论了求解连通无向简图的所有连通子图的算法,并将其应用于化学领域:如何将许多具有某种共同属性的物质的分子结构图形分解成子分子结构,进一步地试图找出存在于大多数具有该属性的物质中的子分子结构,并讨论这样的子分子结构导致物质具有该共同属性的概率。

关键词: 图, 连通图, 子图, 算法, 分子结构

Abstract: This paper discusses the algorithm of seeking all the subgraphs of a connected simple undirected graph, and applies it in chemistry field: how to decompose the molecular structures of those substances which have the same property into sub molecular structures, search the sub molecular structures which is contained in most substances having this property, and calculate the probability that the substances containing the sub molecular structures have the common property.

中图分类号: