Article thumbnail

The complexities of the coefficients of the Tutte polynomial

By J.D. Annan

Abstract

AbstractThe complexity of calculating the coefficients of the Tutte polynomial of a graph is considered. The calculation of some coefficients is shown to be #P-complete, whereas some other coefficients can be computed in polynomial time. However, even for a hard coefficient, it can be decided in polynomial time whether it is less than a fixed constant

Publisher: Published by Elsevier B.V.
Year: 1995
DOI identifier: 10.1016/0166-218X(94)00097-W
OAI identifier:

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.