Matches in DBpedia 2015-10 for { ?s ?p "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)."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Betweenness abstract "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).".
- Betweenness comment "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).".