| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 470616 | Computers & Mathematics with Applications | 2011 | 8 Pages |
Abstract
We study so-called betweennesses induced by trees and forests. Algorithmic problems related to betweennesses are typically hard. They have been studied as relaxations of ordinal embeddings and occur for instance in psychometrics and molecular biology. Our contributions are hardness results, efficient algorithms, and structural insights such as complete axiomatic characterizations.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp M. Schäfer, Jayme L. Szwarcfiter,