Graph compression and the zeros of polynomials
Litow, B., and Deo, N. (2004) Graph compression and the zeros of polynomials. Information Processing Letters, 92 (1). pp. 39-44.
![[img]](http://eprints.jcu.edu.au/style/images/fileicons/application_pdf.png) | PDF (Published Version) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 113Kb |
DOI: 10.1016/j.ipl.2004.06.004
View at Publisher Website: http://dx.doi.org/10.1016/j.ipl.2004.06....
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.
| ID Code: | 6409 |
|---|---|
| Item Type: | Article (Refereed Research - C1) |
| Keywords: | data compression; graphs; theory of computation |
| FoR Codes: | 08 INFORMATION AND COMPUTING SCIENCES > 0802 Computation Theory and Mathematics > 080299 Computation Theory and Mathematics not elsewhere classified @ 100% |
| SEO Codes: | 89 INFORMATION AND COMMUNICATION SERVICES > 8999 Other Information and Communication Services > 899999 Information and Communication Services not elsewhere classified @ 100% |
| Deposited On: | 25 Jan 2010 14:09 |
| Last Modified: | 18 May 2013 00:52 |
| Downloads: | Total: 1 Last 12 Months: 0 |
| Statistics: | More Statistics |
| Citation Counts with External Providers: | Web of Science: 0 |
Repository Staff Only: item control page