Patchworks

DOI10.1006/AIMA.1999.1912MaRDI QIDQ5927521zbMATH OpenOpenAlexFDO

Authors Sebastian Böcker, Andreas W. M. Dress

Publication date 17 February 2002

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/aima.1999.1912

zbMATH Keywords

cluster systemshierarchical clustering

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Graph theory (including graph drawing) in computer science (68R10) Clustering in the social and behavioral sciences (91C20)

Recommendations

• A note on maximal hierarchies
• scientific article; zbMATH DE number 622432
• Patchwork and web spaces
• Slim semimodular lattices. II: A description by patchwork systems
• Point-sensitive and point-free patch constructions

Cites work

• Algorithmic Aspects of Tree Amalgamation
• Patching up \(X\)-trees
• Reconstructing the shape of a tree from observed dissimilarity data
• Tree structures for proximity data
• Trees, taxonomy, and strongly compatible multi-state characters

Cited in

(10)

• Patching and thickening problems
• A note on maximal hierarchies
• Discrete Coons patches
• Combinatorial properties of triplet covers for binary trees
• Phylogenetic flexibility via Hall-type inequalities and submodularity
• Set relations and set systems induced by some families of integral domains
• scientific article; zbMATH DE number 622432 (Why is no real title available?)
• On some categories of structured sets
• Slim sets of binary trees
• A Hall-type theorem for triplet set systems based on medians in trees

This page was built for publication: Patchworks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5927521)