Source coding and graph entropies

DOI10.1109/18.532875zbMath0868.94017OpenAlexW2119336214MaRDI QIDQ4896812

Noga Alon, Alon Orlitsky

Publication date: 31 July 1997

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/672f4301e377874f76fcbc55a8aeff3785a9704f

zbMATH Keywords

graph entropysource codingamortizationchromatic entropy

Mathematics Subject Classification ID

Graph theory (05C99) Source coding (94A29)

Related Items (12)

A parametric worst-case approach to fairness in cooperative games with transferable utility ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Tight results on minimum entropy set cover ⋮ Clique partitioning of interval graphs with submodular costs on the cliques ⋮ Maximum values of degree-based entropies of bipartite graphs ⋮ Entropy and a certain cost-minimal coloring of graph vertices ⋮ Minimum Entropy Combinatorial Optimization Problems ⋮ Minimum entropy combinatorial optimization problems ⋮ Some bounds of weighted entropies with augmented Zagreb index edge weights ⋮ Minimum entropy coloring ⋮ Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems ⋮ Clique partitioning with value-monotone submodular cost

This page was built for publication: Source coding and graph entropies