Editing 2-satisfiability (section)

===Other applications===
2-satisfiability has also been applied to problems of recognizing [[undirected graph]]s that can be partitioned into an [[Independent set (graph theory)|independent set]] and a small number of [[complete bipartite graph|complete bipartite subgraphs]],<ref>{{citation|first1=Andreas|last1=Brandstädt|author1-link=Andreas Brandstädt|first2=Peter Ladislaw|last2=Hammer|author2-link=Peter Ladislaw Hammer|first3=Van Bang|last3=Le|first4=Vadim V.|last4=Lozin|title=Bisplit graphs|journal=[[Discrete Mathematics (journal)|Discrete Mathematics]]|volume=299|issue=1–3|year=2005|pages=11–32|doi=10.1016/j.disc.2004.08.046|doi-access=free}}.</ref> inferring business relationships among autonomous subsystems of the internet,<ref>{{citation|first1=Hao|last1=Wang|first2=Haiyong|last2=Xie|first3=Yang Richard|last3=Yang|first4=Avi|last4=Silberschatz|first5=Li Erran|last5=Li|first6=Yanbin|last6=Liu|title=13TH IEEE International Conference on Network Protocols (ICNP'05) |contribution=Stable egress route selection for interdomain traffic engineering: model and analysis|year=2005|pages=16–29|doi=10.1109/ICNP.2005.39|isbn=978-0-7695-2437-5|citeseerx=10.1.1.106.7345|s2cid=4332805}}.</ref> and reconstruction of [[evolutionary tree]]s.<ref>{{citation|first1=Eleazar|last1=Eskin|first2=Eran|last2=Halperin|first3=Richard M.|last3=Karp|author-link3=Richard Karp|title=Efficient reconstruction of haplotype structure via perfect phylogeny|journal=Journal of Bioinformatics and Computational Biology|year=2003|volume=1|issue=1|pages=1–20|doi=10.1142/S0219720003000174|pmid=15290779}}.</ref>