Abstract
We report about our ongoing study of inter-reducibilities of parameterized numeric graph invariants and graph polynomials. The purpose of this work is to systematize recent emerging work on graph polynomials and various partition functions with respect to their combinatorial expressiveness and computational complexity. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Makowsky, J. A. (2008). Uniform algebraic reducibilities between parameterized numeric graph invariants. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5028 LNCS, pp. 403–406). https://doi.org/10.1007/978-3-540-69407-6_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
