Betweenness

Betweenness is an algorithmic problem in order theory about ordering a collection of items subject to constraints that some items must be placed between others. It has applications in bioinformatics, but was shown to be NP-complete by Opatrný (1979).