Geodesic
Evaluating a weighted graph polynomial for graphs of bounded tree-width
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We show that for any $k$ there is a polynomial time algorithm to evaluate the weighted graph polynomial $U$ of any graph with tree-width at most $k$ at any point. For a graph with $n$ vertices, the algorithm requires $O(a_k n^{2k+3})$ arithmetical operations, where $a_k$ depends only on $k$.
DOI : 10.37236/153
Classification : 05C85, 05C15, 68R10 
@article{10_37236_153,
     author = {S. D. Noble},
     title = {Evaluating a weighted graph polynomial for graphs of bounded tree-width},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/153},
     zbl = {1209.05249},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/153/}
}
TY  - JOUR
AU  - S. D. Noble
TI  - Evaluating a weighted graph polynomial for graphs of bounded tree-width
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/153/
DO  - 10.37236/153
ID  - 10_37236_153
ER  - 
%0 Journal Article
%A S. D. Noble
%T Evaluating a weighted graph polynomial for graphs of bounded tree-width
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/153/
%R 10.37236/153
%F 10_37236_153
S. D. Noble. Evaluating a weighted graph polynomial for graphs of bounded tree-width. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/153

Cité par Sources :