Computing the characteristic polynomial of threshold graphs

Visualizar/abrir
Data
2014
Autor
Tipo
URI
http://hdl.handle.net/10183/282104
Assunto
Abstract
We present an algorithm for constructing the characteristic polynomial of a threshold graph’s adjacency matrix. The algorithm is based on a diagonalization procedure that is easy to describe. It can be implemented using O(n) space and with running time O(n 2 ).
Contido em
Journal of Graph Algorithms and Applications. Providence. Vol. 18, n. 5 (2014), p. 709-719
Origem
Estrangeiro
Coleções
 
   

Este item está licenciado na Creative Commons License