Estimating the size of correcting codes using extremal graph problems

DOI10.1007/978-0-387-98096-6_12zbMath1181.94137OpenAlexW91900014MaRDI QIDQ3407619

Petro I. Stetsyuk, Ivan V. Sergienko, Vladimir P. Shylo, Sergiy I. Butenko, Panos M. Pardalos

Publication date: 4 March 2010

Published in: Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-98096-6_12

zbMATH Keywords

combinatorial optimizationgraph coloringcoding theoryerror-correcting codesmaximum independent set

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Synchronization error-correcting codes (94B50)

Related Items

The packing number of the double vertex graph of the path graph, On the maximal independence polynomial of the covering graph of the hypercube up to \(n=6\), Generating \((2,3)\)-codes, Clique-detection models in computational biochemistry and genomics, On the Power of Simple Reductions for the Maximum Independent Set Problem

Uses Software

• DIMACS