Graph compression and the zeros of polynomials
type: Item
instance of: scholarly article
title: Graph compression and the zeros of polynomials
zbMATH Open document ID: 1173.68610
author: Narsingh Deo
author: Bruce Litow
published in: Information Processing Letters
publication date: 2009-08-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 5599130
zbMATH Keywords: theory of computation
zbMATH Keywords: data compression
zbMATH Keywords: graphs
MaRDI profile type: Publication
full work available at URL: j.ipl.2004.06.004
OpenAlex ID: W2085667426
cites work: Q4471358
cites work: Orderly spanning trees with applications to graph encoding and graph drawing
cites work: A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
cites work: Representation of graphs
cites work: Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits
cites work: Q3992465
cites work: Q4002529
cites work: Q4282674
cites work: Succinct representation of balanced parentheses and static trees
cites work: Succinct representation of general unlabeled graphs
cites work: Q4023358
DOI: 10.1016/J.IPL.2004.06.004
Recommended article: Some remarks on the compressed zero-divisor graph
Recommended article: Zeros of graph-counting polynomials
Recommended article: On the Complexity of Polynomial Zeros
Recommended article: Q3447288
Recommended article: Compression and Erdős-Ko-Rado graphs
Recommended article: Zeros of chromatic and flow polynomials of graphs
Recommended article: Bounds for the zeros of polynomials from compression matrix inequalities
Recommended article: On the diameter of the compressed zero-divisor graph
Recommended article: Compressions, graphs, and hyperreflexivity
Recommended article: Compressed zero-divisor graphs of matrix rings over finite fields
description: scientific article; zbMATH DE number 5599130