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 条
  • [41] Distance-Constraint Reachability Computation in Uncertain Graphs
    Jin, Ruoming
    Liu, Lin
    Ding, Bolin
    Wang, Haixun
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2011, 4 (09): : 551 - 562
  • [42] On the Spectra of Reduced Distance Matrix of Thorn Graphs
    Heydari, Abbas
    IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY, 2011, 2 (01): : 81 - 87
  • [43] UNICYCLIC GRAPHS AND THE INERTIA OF THE SQUARED DISTANCE MATRIX
    Howell, Christian
    Kempton, Mark
    Sandall, Kellon
    Sinkovic, John
    ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2023, 39 : 491 - 515
  • [44] On squared distance matrix of complete multipartite graphs
    Das, Joyentanuj
    Mohanty, Sumit
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2024, 55 (02): : 517 - 537
  • [45] Distance matrix and Laplacian of a tree with attached graphs
    Bapat, RB
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 411 : 295 - 308
  • [46] Efficient parallel algorithms for euclidean distance transform
    Chen, L
    Pan, Y
    Chen, YX
    Xu, XH
    COMPUTER JOURNAL, 2004, 47 (06): : 694 - 700
  • [47] Fast parallel chessboard distance transform algorithms
    Lee, YH
    Horng, SJ
    1996 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 1996, : 488 - 493
  • [48] Fast suboptimal algorithms for the computation of graph edit distance
    Neuhaus, Michel
    Riesen, Kaspar
    Bunke, Horst
    STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, PROCEEDINGS, 2006, 4109 : 163 - 172
  • [49] PARALLEL ALGORITHMS FOR COMPUTATION OF THE MANIPULATOR INERTIA MATRIX
    AMINJAVAHERI, M
    ORIN, DE
    INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 1991, 10 (02): : 162 - 170
  • [50] Parallel and Scalable Heat Methods for Geodesic Distance Computation
    Tao, Jiong
    Zhang, Juyong
    Deng, Bailin
    Fang, Zheng
    Peng, Yue
    He, Ying
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2021, 43 (02) : 579 - 594
12345