Pages that link to "Item:Q809099"
From MaRDI portal
The following pages link to From copair hypergraphs to median graphs with latent vertices (Q809099):
Displaying 16 items.
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes (Q463287) (← links)
- An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex (Q696831) (← links)
- On the use of ordered sets in problems of comparison and consensus of classifications (Q1104668) (← links)
- Convex tree realizations of partitions (Q1195647) (← links)
- Median graphs and tree analysis of dichotomous data, an approach to qualitative factor analysis (Q1263914) (← links)
- A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction (Q1293419) (← links)
- On the number of vertices and edges of the Buneman graph (Q1293464) (← links)
- Some variations on a theme by Buneman (Q1293465) (← links)
- Quasi-median graphs from sets of partitions (Q1613411) (← links)
- A polynomial time algorithm for constructing the refined Buneman tree (Q1808975) (← links)
- Replacing cliques by stars in quasi-median graphs (Q1887054) (← links)
- Uprooted phylogenetic networks (Q2408571) (← links)
- (Q2741277) (← links)
- Retracts of hypercubes (Q3344238) (← links)
- What Do Trees and Hypercubes Have in Common? (Q5506781) (← links)
- Injective split systems (Q6115433) (← links)
