On subbetweennesses of trees: Hardness, algorithms, and characterizations

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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. © 2011 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Rautenbach, D., Dos Santos, V. F., Schfer, P. M., & Szwarcfiter, J. L. (2011). On subbetweennesses of trees: Hardness, algorithms, and characterizations. Computers and Mathematics with Applications, 62(12), 4674–4681. https://doi.org/10.1016/j.camwa.2011.10.056

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free