From copair hypergraphs to median graphs with latent vertices
From MaRDI portal
Publication:809099
Recommendations
Cites work
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 3777200 (Why is no real title available?)
- n‐cubes and median graphs
- A ternary operation in distributive lattices
- Discrete Ordered Sets whose Covering Graphs are Median
- Median algebras
- Median graphs and Helly hypergraphs
- Metric Ternary Distributive Semi-Lattices
Cited in
(16)- Injective split systems
- Median graphs and tree analysis of dichotomous data, an approach to qualitative factor analysis
- Quasi-median graphs from sets of partitions
- A polynomial time algorithm for constructing the refined Buneman tree
- Uprooted phylogenetic networks
- What do trees and hypercubes have in common?
- On the number of vertices and edges of the Buneman graph
- A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction
- Some variations on a theme by Buneman
- A comparison of ordinal analysis techniques in medical resource usage research
- Replacing cliques by stars in quasi-median graphs
- An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex
- Retracts of hypercubes
- On the use of ordered sets in problems of comparison and consensus of classifications
- Convex tree realizations of partitions
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
This page was built for publication: From copair hypergraphs to median graphs with latent vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809099)