Universal compression of sparse labeled graphs
Statement
For sparse -vertex graphs of average degree whose vertices have distinct -length labels over a finite alphabet, construct universal codes analogous to Lempel–Ziv that achieve asymptotically optimal compression.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.