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 条
  • [1] Efficient parallel algorithms on distance hereditary graphs
    Sun-Yuan, Hsieh
    Parallel Processing Letters, 1999, 9 (01): : 43 - 52
  • [2] Parallel Distance Matrix Computation for Matlab Data Mining
    Skurowski, Przemyslaw
    Staniszewski, Michal
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2015 (ICNAAM-2015), 2016, 1738
  • [3] Distance Independence Polynomial of Graphs
    Arriesgado, Amelia L.
    Salim, Jeffrey Imer C.
    INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 2024, 19 (04): : 1231 - 1236
  • [4] EFFICIENT PARALLEL RECOGNITION ALGORITHMS OF COGRAPHS AND DISTANCE HEREDITARY GRAPHS
    DAHLHAUS, E
    DISCRETE APPLIED MATHEMATICS, 1995, 57 (01) : 29 - 44
  • [5] PARALLEL COMPUTATION OF THE MATRIX OF THE CHEMICAL DISTANCES FOR DEFECTIVE GRAPHS
    ORI, O
    DESTRI, G
    MARENZONI, P
    MOLECULAR SIMULATION, 1994, 12 (01) : 49 - 56
  • [6] Distance hereditary graphs and the interlace polynomial
    Ellis-Monaghan, Joanna A.
    Sarmiento, Irasema
    COMBINATORICS PROBABILITY & COMPUTING, 2007, 16 (06): : 947 - 973
  • [7] Efficient parallel algorithms on distance-hereditary graphs (extended abstract)
    Hsieh, SY
    Ho, CW
    Hsu, TS
    Ko, MT
    Chen, GH
    PROCEEDINGS OF THE 1997 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, 1997, : 20 - 23
  • [8] PARALLEL ALGORITHMS FOR THE DISTANCE TRANSFORMATION
    EMBRECHTS, H
    ROOSE, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 588 : 387 - 391
  • [9] On the rank of the distance matrix of graphs
    Dratman, Ezequiel
    Grippo, Luciano N.
    Moyano, Veronica
    Pastine, Adrian
    APPLIED MATHEMATICS AND COMPUTATION, 2022, 433
  • [10] PARALLEL ALGORITHMS FOR THE DISTANCE TRANSFORMATION
    EMBRECHTS, H
    ROOSE, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 634 : 571 - 582
12345