Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width

Noble, Steven (2009) Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width. The Electronic Journal of Combinatorics 16 (1), R64. ISSN 1077-8926.

Full text not available from this repository.

Official URL: https://www.combinatorics.org/ojs/index.php/eljc/a...

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 2 k +3 ) arithmetical opera- tions, where a k depends only on k

Metadata

Item Type:	Article
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Administrator
Date Deposited:	06 Jan 2023 16:25
Last Modified:	09 Aug 2023 12:54
URI:	https://eprints.bbk.ac.uk/id/eprint/50386

Statistics

Archive Staff Only (login required)