Applications of maximum independent set
Abbas Musleh Salman, Ahmed Sabah Al-Jilawi · AIP conference proceedings · 2022
Combinatorial optimizations is subfield optimization which exists to find the optimality from finite set, and it has important applications in several fields. NP- hard problem is one of the important tools in combinatorial optimizations. We introduce classical application problems of maximum independent set in real daily life. We discuss known applications and different approaches. This list of several discussed applications are Matching Molecular Structures by Clique Detection, Macromolecular Docking, Integration of Genome Mapping Data, Comparative Modeling of Protein Structure, Covering Location Using Clique Partition, and coding theory and graph coloring. Also, this paper presents simple algorithms for NP-hard problem.