Sciweavers

Share
CIE
2006
Springer

From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials

10 years 7 months ago
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generalizations of the Tutte polynomial, matching polynomials, interlace polynomials, and the cover polynomial of digraphs. We introduce the class of (hyper)graph polynomials definable in second order logic, and outline a research program for their classification in terms of definability and complexity considerations, and various notions of reducibilities.
Johann A. Makowsky
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where CIE
Authors Johann A. Makowsky
Comments (0)
books