An \(O(n^2)\) algorithm for the characteristic polynomial of a tree (Q2741473)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An \(O(n^2)\) algorithm for the characteristic polynomial of a tree |
scientific article; zbMATH DE number 1642879
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^2)\) algorithm for the characteristic polynomial of a tree |
scientific article; zbMATH DE number 1642879 |
Statements
24 October 2001
0 references
adjacency matrix
0 references
An \(O(n^2)\) algorithm for the characteristic polynomial of a tree (English)
0 references
