Finding maximum independent sets in graphs arising from coding theory

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2002, Pages 542-546

  Butenko, Sergiy ^a   Pardalos, Panos ^a   Sergienko, Ivan ^a   Shylo, Vladimir ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Codes for Z channel; Deletion correcting codes; Maximum independent set; Transposition correction codes

Indexed keywords

ALGORITHMS; BINARY CODES; COMBINATORIAL MATHEMATICS; ENCODING (SYMBOLS); ERROR CORRECTION; GRAPH THEORY; HEURISTIC METHODS; MAXIMUM PRINCIPLE; OPTIMIZATION; PACKET NETWORKS; SET THEORY; THEOREM PROVING;

BINARY CORRECTING CODES; BRANCH AND BOUND ALGORITHM; CODING THEORY; COMBINATORIAL OPTIMIZATION; DELETION CORRECTING CODES; MAXIMUM INDEPENDENT SETS; PACKET LOSS; TRANSPOSITION CORRECTION CODES; Z CHANNEL;

COMPUTATIONAL METHODS;

EID: 0036038537     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Finding independent sets in a graph using continuous multivariable polynomial formulations
2. New local search approximation techniques for maximum generalized satisfiability problems
3. The maximum clique problem
4. Iterative solution of linear and quadratic programming problems
5. Approximate algorithm for solving the maximum independent set problem
6. Test cases for the maximum clique problem
7. Challenge problems: Independent sets in graphs
8. On single-deletion-correcting codes