Order distances and split systems

DOI10.1007/s11083-021-09579-yOpenAlexW3200061272MaRDI QIDQ2160024

Andreas Spillner, Vincent L. Moulton

Publication date: 2 August 2022

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.10119

zbMATH Keywords

total preordercircular split systemorder distanceflat split systemKalmanson distancetreelike distance

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

Uses Software

• FlatNJ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing distances between partial rankings
• A canonical decomposition theory for metrics on a finite set
• Order distance associated with a hierarchy
• A note on circular decomposable metrics
• Ordinal properties of tree distances
• Linearly independent split systems
• Optimal algorithms for computing edge weights in planar split networks
• The structure of circular decomposable metrics
• Edgeconvex Circuits and the Traveling Salesman Problem
• When Can Splits be Drawn in the Plane?
• Comparing Partial Rankings
• Geometry of cuts and metrics

This page was built for publication: Order distances and split systems