Geodesic
Computing the Characteristic Polynomial of Threshold Graphs
Journal of graph algorithms and applications, Tome 18 (2014) no. 5, pp. 709-719 Cet article a éte moissonné depuis la source Journal of Graph Algorythms and Applications website

Voir la notice de l'article

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(n2). 
@article{JGAA_2014_18_5_a2,
     author = {David Jacobs and Vilmar Trevisan and Fernando Tura},
     title = {Computing the {Characteristic} {Polynomial} of {Threshold} {Graphs}},
     journal = {Journal of graph algorithms and applications},
     pages = {709--719},
     year = {2014},
     volume = {18},
     number = {5},
     doi = {10.7155/jgaa.00342},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00342/}
}
TY  - JOUR
AU  - David Jacobs
AU  - Vilmar Trevisan
AU  - Fernando Tura
TI  - Computing the Characteristic Polynomial of Threshold Graphs
JO  - Journal of graph algorithms and applications
PY  - 2014
SP  - 709
EP  - 719
VL  - 18
IS  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00342/
DO  - 10.7155/jgaa.00342
LA  - en
ID  - JGAA_2014_18_5_a2
ER  - 
%0 Journal Article
%A David Jacobs
%A Vilmar Trevisan
%A Fernando Tura
%T Computing the Characteristic Polynomial of Threshold Graphs
%J Journal of graph algorithms and applications
%D 2014
%P 709-719
%V 18
%N 5
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00342/
%R 10.7155/jgaa.00342
%G en
%F JGAA_2014_18_5_a2
David Jacobs; Vilmar Trevisan; Fernando Tura. Computing the Characteristic Polynomial of Threshold Graphs. Journal of graph algorithms and applications, Tome 18 (2014) no. 5, pp. 709-719. doi: 10.7155/jgaa.00342

Cité par Sources :