Title

Graph compression and the zeros of polynomials

Authors

Authors

B. Litow;N. Deo

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Inf. Process. Lett.

Keywords

theory of computation; data compression; graphs; REPRESENTATION; Computer Science, Information Systems

Abstract

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.

Journal Title

Information Processing Letters

Volume

92

Issue/Number

1

Publication Date

1-1-2004

Document Type

Article

Language

English

First Page

39

Last Page

44

WOS Identifier

WOS:000223839000006

ISSN

0020-0190

Share

COinS