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 条
  • [21] The Distance Randić Matrix of Connected Graphs
    Roberto C. Díaz
    Oscar Rojo
    Bulletin of the Brazilian Mathematical Society, New Series, 2022, 53 : 49 - 68
  • [22] On Spectra of Distance Randic Matrix of Graphs
    Ganie, Hilal A.
    Rather, Bilal Ahmad
    BULLETIN OF THE BRAZILIAN MATHEMATICAL SOCIETY, 2022, 53 (04): : 1449 - 1467
  • [23] The exponential distance matrix of block graphs
    Xing, Rundan
    Du, Zhibin
    APPLIED MATHEMATICS AND COMPUTATION, 2023, 447
  • [24] The Distance Randic Matrix of Connected Graphs
    Diaz, Roberto C.
    Rojo, Oscar
    BULLETIN OF THE BRAZILIAN MATHEMATICAL SOCIETY, 2022, 53 (01): : 49 - 68
  • [25] NEW ALGORITHMS FOR POLYNOMIAL AND TRIGONOMETRIC INTERPOLATION ON PARALLEL COMPUTERS
    BARON, I
    SIDI, A
    BIT, 1992, 32 (03): : 464 - 480
  • [26] THE COMPUTATION OF THE DISTANCE MATRIX AND THE WIENER INDEX FOR GRAPHS OF ARBITRARY COMPLEXITY WITH WEIGHTED VERTICES AND EDGES
    SENN, P
    COMPUTERS & CHEMISTRY, 1988, 12 (03): : 219 - 227
  • [27] A Novel Parallel Algorithm for Edit Distance Computation
    Yousaf, Muhammad Murtaza
    Sadiq, Muhammad Umair
    Aslam, Laeeq
    Ul Qounain, Waqar
    Sarwar, Shahzad
    MEHRAN UNIVERSITY RESEARCH JOURNAL OF ENGINEERING AND TECHNOLOGY, 2018, 37 (01) : 223 - 232
  • [28] POLYNOMIAL TIME ALGORITHMS FOR COMPUTING A MINIMUM HULL SET IN DISTANCE-HEREDITARY AND CHORDAL GRAPHS
    Kante, Mamadou Moustapha
    Nourine, Lhouari
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, 30 (01) : 311 - 326
  • [29] Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs
    Kante, Mamadou Moustapha
    Nourine, Lhouari
    SOFSEM 2013: Theory and Practice of Computer Science, 2013, 7741 : 268 - 279
  • [30] Parallel computation of exact Euclidean distance transform
    Lee, YH
    Horng, SJ
    Kao, TW
    Jaung, FS
    Chen, YJ
    Tsai, HR
    PARALLEL COMPUTING, 1996, 22 (02) : 311 - 325
12345