Graph compression and the zeros of polynomials
Abbreviated Journal Title
Inf. Process. Lett.
theory of computation; data compression; graphs; REPRESENTATION; Computer Science, Information Systems
We explore a novel quantitative relationship between the compressibility of directed graphs and the disposition of the zeros of polynomials with rational coefficients. The connection highlights the genericity of incompressible graphs and the genericity of polynomials all of whose zeros are simple. (C) 2004 Elsevier B.V. All rights reserved.
Information Processing Letters
"Graph compression and the zeros of polynomials" (2004). Faculty Bibliography 2000s. 4552.