Editing Independent set (graph theory) (section)

== Applications ==
The maximum independent set and its complement, the [[Vertex cover|minimum vertex cover]] problem, is involved in proving the [[Computational complexity theory|computational complexity]] of many theoretical problems.<ref>{{Cite book|last=Skiena, Steven S.|title=The algorithm design manual|date=2012|publisher=Springer|isbn=978-1-84800-069-8|oclc=820425142}}</ref> They also serve as useful models for real world optimization problems, for example maximum independent set is a useful model for discovering stable [[Gene regulatory network|genetic components]] for designing [[Synthetic biology|engineered genetic systems]].<ref>{{Cite journal|last1=Hossain|first1=Ayaan|last2=Lopez|first2=Eriberto|last3=Halper|first3=Sean M.|last4=Cetnar|first4=Daniel P.|last5=Reis|first5=Alexander C.|last6=Strickland|first6=Devin|last7=Klavins|first7=Eric|last8=Salis|first8=Howard M.|date=2020-07-13|title=Automated design of thousands of nonrepetitive parts for engineering stable genetic systems|url=https://www.nature.com/articles/s41587-020-0584-2|journal=Nature Biotechnology|volume=38|issue=12|language=en|pages=1466–1475|doi=10.1038/s41587-020-0584-2|pmid=32661437|s2cid=220506228|issn=1546-1696}}</ref>