ALGORITHMS FOR THE COMPUTATION OF MOLECULAR DISTANCE MATRIX AND DISTANCE POLYNOMIAL OF CHEMICAL GRAPHS ON PARALLEL COMPUTERS

被引：2
|
作者：
THANGAVEL, P
VENUVANALINGAM, P
机构：
[1] BHARATHIDASAN UNIV, DEPT CHEM, Tiruchirappalli 620024, INDIA
[2] BHARATHIDASAN UNIV, DEPT MATH, Tiruchirappalli 620024, INDIA
来源：
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES | 1993年 / 33卷 / 03期
关键词：
D O I：
10.1021/ci00013a018
中图分类号：
O6 [化学];
学科分类号：
0703 ;
摘要：
A parallel algorithm adaptable to supercomputers is developed, based on the modified matrix multiplication scheme, to construct the molecular distance matrix from the simple connectivity matrix of chemical graphs. This algorithm is combined with our earlier algorithm5 for the computation of distance polynomials of chemical graphs. The present algorithm can also handle weighted and directed graphs. Our algorithm for the construction of distance matrix takes only 0(log2 n) time in the CRCW PRAM model with 0(n3) processors. The algorithm for the computation of distance polynomial will take only linear time in the same configuration.
引用
收藏
页码：412 / 414
页数：3
相关论文
共 50 条
  • [31] Distributed algorithm for parallel edit distance computation
    Sadiq M.U.
    Yousaf M.M.
    Computing and Informatics, 2021, 39 (04) : 757 - 779
  • [32] DISTRIBUTED ALGORITHM FOR PARALLEL EDIT DISTANCE COMPUTATION
    Sadiq, Muhammad Umair
    Yousaf, Muhammad Murtaza
    COMPUTING AND INFORMATICS, 2020, 39 (04) : 757 - 779
  • [33] PARALLEL COMPUTATION OF THE HAUSDORFF DISTANCE BETWEEN IMAGES
    BOSSOMAIER, T
    LOEFF, A
    PARALLEL COMPUTING, 1993, 19 (10) : 1129 - 1140
  • [34] Parallel computation on interval graphs: algorithms and experiments
    Ferreira, A
    Lassous, IG
    Marcus, K
    Rau-Chaplin, A
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2002, 14 (11): : 885 - 910
  • [35] Formulas for the computation of the Tutte polynomial of graphs with parallel classes
    Mphako-Banda, Eunice
    Allagan, Julian A.
    ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2018, 6 (01) : 113 - 122
  • [36] An explicit formula for the distance characteristic polynomial of threshold graphs
    João Lazzarin
    Oscar F. Márquez
    Fernando C. Tura
    Computational and Applied Mathematics, 2023, 42
  • [37] An explicit formula for the distance characteristic polynomial of threshold graphs
    Lazzarin, Joao
    Marquez, Oscar F.
    Tura, Fernando C.
    COMPUTATIONAL & APPLIED MATHEMATICS, 2023, 42 (05):
  • [38] Parallel decomposition of distance-hereditary graphs
    Hsieh, SY
    PARALLEL COMPUTATION, 1999, 1557 : 417 - 426
  • [39] OPTIMAL DISTANCE NETWORKS OF LOW DEGREE FOR PARALLEL COMPUTERS
    BEIVIDE, R
    HERRADA, E
    BALCAZAR, JL
    ARRUABARRENA, A
    IEEE TRANSACTIONS ON COMPUTERS, 1991, 40 (10) : 1109 - 1124
  • [40] Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
    Kiyomi, Masashi
    Saitoh, Toshiki
    Uehara, Ryuhei
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (03) : 426 - 432
12345