COMPUTATIONAL TECHNIQUES FOR VERTEX PARTITIONING OF GRAPHS

被引：26

作者：

LIU, XY ^{[1
]}

BALASUBRAMANIAN, K ^{[1
]}

MUNK, ME ^{[1
]}

机构：

[1] ARIZONA STATE UNIV, DEPT CHEM, TEMPE, AZ 85287 USA

来源：

JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES | 1990年 / 30卷 / 03期

关键词：

D O I：

10.1021/ci00067a009

中图分类号：

O6 [化学];

学科分类号：

0703 ;

摘要：

A powerful vertex-partitioning algorithm is developed and applied for vertex partitioning of graphs of chemical and spectroscopic interest. The codes developed on the basis of these algorithms are tested and compared for performance with other methods based on the Morgan algorithm and the principal eigenvector algorithm based on the Givens–Householder method. The newly developed algorithm and codes appear to be more powerful than the Morgan and the principal eigenvector algorithms for vertex partitioning of graphs. © 1990, American Chemical Society. All rights reserved.

引用

页码：263 / 269

页数：7

共 30 条

[1] COMPUTER-GENERATION OF SPECTRA OF GRAPHS - APPLICATIONS TO C60 CLUSTERS AND OTHER SYSTEMS [J].