Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2009 | ELECTRONIC JOURNAL OF COMBINATORICS | tree width |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Line graph,Graph power,Tutte polynomial,Cubic graph,Distance-regular graph,Factor-critical graph,Butterfly graph,Mathematics,Voltage graph | Journal | 16 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 5 |
PageRank | References | Authors |
0.49 | 12 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. D. Noble | 1 | 83 | 9.56 |