Computing the characteristic polynomial of threshold graphs

dc.contributor.author	Jacobs, David Pokrass	pt_BR
dc.contributor.author	Trevisan, Vilmar	pt_BR
dc.contributor.author	Tura, Fernando Colman	pt_BR
dc.date.accessioned	2024-12-05T06:52:00Z	pt_BR
dc.date.issued	2014	pt_BR
dc.identifier.issn	1526-1719	pt_BR
dc.identifier.uri	http://hdl.handle.net/10183/282104	pt_BR
dc.description.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 ).	en
dc.format.mimetype	application/pdf	pt_BR
dc.language.iso	eng	pt_BR
dc.relation.ispartof	Journal of Graph Algorithms and Applications. Providence. Vol. 18, n. 5 (2014), p. 709-719	pt_BR
dc.rights	Open Access	en
dc.subject	Algoritmos	pt_BR
dc.subject	Matriz de adjacência	pt_BR
dc.subject	Grafo de limiar	pt_BR
dc.subject	Diagonalização	pt_BR
dc.title	Computing the characteristic polynomial of threshold graphs	pt_BR
dc.type	Artigo de periódico	pt_BR
dc.identifier.nrb	001212392	pt_BR
dc.type.origin	Estrangeiro	pt_BR

Este item está licenciado na Creative Commons License