Source coding and graph entropies
From MaRDI portal
Recommendations
Cited in
(18)- Minimum entropy coloring
- Some bounds of weighted entropies with augmented Zagreb index edge weights
- Maximum values of degree-based entropies of bipartite graphs
- Clique partitioning with value-monotone submodular cost
- Entropy and a certain cost-minimal coloring of graph vertices
- A parametric worst-case approach to fairness in cooperative games with transferable utility
- Heapability, interactive particle systems, partial orders: results and open problems
- Clique partitioning of interval graphs with submodular costs on the cliques
- scientific article; zbMATH DE number 3856980 (Why is no real title available?)
- Minimum entropy combinatorial optimization problems
- scientific article; zbMATH DE number 1092008 (Why is no real title available?)
- Coding for computing
- Randomly colouring graphs (a combinatorial view)
- scientific article; zbMATH DE number 1440644 (Why is no real title available?)
- Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
- Toward better depth lower bounds: a KRW-like theorem for strong composition
- Minimum entropy combinatorial optimization problems
- Tight results on minimum entropy set cover
This page was built for publication: Source coding and graph entropies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896812)
