COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A TREE

被引：10

作者：

Mohar, Bojan ^{[1
]}

机构：

[1] Univ Ljubljana, Dept Math, Ljubljana 61111, Yugoslavia, Yugoslavia

来源：

JOURNAL OF MATHEMATICAL CHEMISTRY | 1989年 / 3卷 / 04期

关键词：

D O I：

10.1007/BF01169021

中图分类号：

O6 [化学];

学科分类号：

0703 ;

摘要：

An algorithm is given for computing the values of the characteristic polynomial of a tree. Its time complexity is linear; hence, the polynomial is readily accessible from the tree and no computation is necessary to get the polynomial ready for applications. If necessary, the coefficients can be determined in time O(n(2)). This improves the complexity O(n(3)), reached by Tinhofer and Schreck, to O(1).

引用

页码：403 / 406

页数：4

共 50 条

[1] COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A TREE
TINHOFER, G
SCHRECK, H
[J]. COMPUTING, 1985, 35 (02) : 113 - 125
[2] METHOD FOR COMPUTING THE CHARACTERISTIC POLYNOMIAL
MLADENOV, IM
KOTAROV, MD
VASSILEVAPOPOVA, JG
[J]. INTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY, 1980, 18 (01) : 339 - 341
[3] The CHACM method for computing the characteristic polynomial of a polynomial matrix
Yu, B
Kitamoto, T
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000, E83A (07) : 1405 - 1410
[4] ON THE DANILEWSKI METHOD FOR COMPUTING THE CHARACTERISTIC POLYNOMIAL
HANSEN, EE
[J]. COMMUNICATIONS OF THE ACM, 1961, 4 (07) : 301 - 301
[5] Calculating the characteristic polynomial and the eigenvectors of a tree
John, PE
Schild, G
[J]. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 1996, (34) : 217 - 237
[6] Combinatorial approach for computing the characteristic polynomial of a matrix
Belardo, Francesco
Li Marzi, Enzo M.
Simic, Slobodan K.
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2010, 433 (8-10) : 1513 - 1523
[7] Efficient algorithms for computing the characteristic polynomial in a domain
Abdeljaoued, J
Malaschonok, GI
[J]. JOURNAL OF PURE AND APPLIED ALGEBRA, 2001, 156 (2-3) : 127 - 145
[8] Computing the linear complexity for sequences with characteristic polynomial fv
Ana Sălăgean
Alex J. Burrage
Raphael C. -W. Phan
[J]. Cryptography and Communications, 2013, 5 : 163 - 177
[9] Acceleration of computing of a determinant and a characteristic polynomial without divisions
Sejfullin, T.R.
[J]. Kibernetika i Sistemnyj Analiz, 2003, (06): : 32 - 45
[10] Computing characteristic sets of bounded unions of polynomial ideals
Takamatsu, Itsuo
Kobayashi, Masanori
Tokunaga, Hiroo
Yamamoto, Akihiro
[J]. NEW FRONTIERS IN ARTIFICIAL INTELLIGENCE, 2008, 4914 : 318 - +

← 1 2 3 4 5 →