Graph compression and the zeros of polynomials

Authors:
B. Litow;N. Deo
Affiliations:
School of Information Technology, James Cook University, Townsville, Qld, 4811, Australia;School of Computer Science, University of Central Florida, Orlando, FL
Venue:
Information Processing Letters
Year:
2004

Citing 11
Cited 0

Implicit representation of graphs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Succinct representation of general unlabeled graphs

Discrete Applied Mathematics
Mathematics for computer algebra

Mathematics for computer algebra
Algorithmic algebra

Algorithmic algebra
An introduction to Kolmogorov complexity and its applications

An introduction to Kolmogorov complexity and its applications
Hilbert's tenth problem

Hilbert's tenth problem
Orderly spanning trees with applications to graph encoding and graph drawing

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct Representation of Balanced Parentheses and Static Trees

SIAM Journal on Computing
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs

SIAM Journal on Computing
Compact representations of separable graphs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.89

Visualization

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.