On zero-error codes produced by greedy algorithms
From MaRDI portal
Recommendations
Cites work
- An approximation of the zero error capacity by a greedy algorithm
- Average distance is submultiplicative and subadditive with respect to the strong product of graphs
- Backtracking to compute the closed-shell independence number of a fullerene
- Basic modern algebra with applications
- Bijective combinatorics
- Elements of Information Theory
- Exact exponential algorithms.
- Graph Colorings
- Handbook of graph theory
- Handbook of product graphs
- Havel-Hakimi residues of unigraphs
- scientific article; zbMATH DE number 2197920 (Why is no real title available?)
- scientific article; zbMATH DE number 3397564 (Why is no real title available?)
- Information theory. Coding theorems for discrete memoryless systems
- Introduction to algorithms.
- Kronecker graphs: an approach to modeling networks
- New lower bound on the Shannon capacity of \(C_7\) from circular graphs
- New lower bounds for the Shannon capacity of odd cycles
- New potential functions for greedy independence and coloring
- Numerical invariants and the strong product of graphs
- On a Problem of C. E. Shannon in Graph Theory
- On the growth of large independent sets in scale-free networks
- On the independence number of a graph in terms of order and size
- On the independence number of some strong products of cycle-powers
- On the residue of a graph
- On the Shannon capacity of a graph
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- The chromatic gap and its extremes
- The Shannon capacity of a graph and the independence numbers of its powers
- The Theory of Information and Coding
- Zero-error information theory
Cited in
(3)
This page was built for publication: On zero-error codes produced by greedy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084654)
