On zero-error codes produced by greedy algorithms
type: Item
instance of: scholarly article
title: On zero-error codes produced by greedy algorithms
zbMATH Open document ID: 1504.90174
author: Marcin Jurkiewicz
published in: Journal of Combinatorial Optimization
publication date: 2022-10-18T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7603301
zbMATH Keywords: Shannon capacity
zbMATH Keywords: zero-error code
zbMATH Keywords: greedy algorithm
zbMATH Keywords: strong product
zbMATH Keywords: independence number
describes a project that uses: KronFit
MaRDI profile type: Publication
full work available at URL: s10878-021-00825-y
OpenAlex ID: W3210710155
cites work: Basic Modern Algebra with Applications
cites work: The Shannon capacity of a graph and the independence numbers of its powers
cites work: Havel-Hakimi residues of unigraphs
cites work: Q5665207
cites work: New potential functions for greedy independence and coloring
cites work: On the Growth of Large Independent Sets in Scale-Free Networks
cites work: Q5466063
cites work: Q3651735
cites work: Elements of Information Theory
cites work: Information Theory
cites work: On the residue of a graph
cites work: Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
cites work: Exact exponential algorithms.
cites work: Q5454403
cites work: Handbook of graph theory
cites work: The chromatic gap and its extremes
cites work: Numerical invariants and the strong product of graphs
cites work: Q3005852
cites work: On the independence number of a graph in terms of order and size
cites work: Average distance is submultiplicative and subadditive with respect to the strong product of graphs
cites work: An approximation of the zero error capacity by a greedy algorithm
cites work: On the independence number of some strong products of cycle-powers
cites work: Zero-error information theory
cites work: Graph Colorings
cites work: Kronecker graphs: an approach to modeling networks
cites work: Q3065437
cites work: On the Shannon capacity of a graph
cites work: New lower bounds for the Shannon capacity of odd cycles
cites work: The Theory of Information and Coding
cites work: New lower bound on the Shannon capacity of \(C_7\) from circular graphs
cites work: On a Problem of C. E. Shannon in Graph Theory
DOI: 10.1007/S10878-021-00825-Y
description: scientific article; zbMATH DE number 7603301