Title

Graph Compression And The Zeros Of Polynomials

Keywords

Data compression; Graphs; Theory of computation

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. © 2004 Elsevier B.V. All rights reserved.

Publication Date

10-16-2004

Publication Title

Information Processing Letters

Volume

92

Issue

1

Number of Pages

39-44

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/j.ipl.2004.06.004

Socpus ID

4344671826 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/4344671826

This document is currently not available here.

Share

COinS