Abstract
Nested clusters arise independently in graph partitioning and in the study of contours. We take a step toward unifying these two instances of nested clusters. We show that the graph theoretical tight clusters introduced by Dress, Steel, Moulton and Wu in 2010 are a special case of nested clusters associated to contours.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
BĂDOIU, M., CHUZHOY, J., INDYK, P., and SIDIROPOULOS, A. (2006), “Embedding Ultrametrics into Low-Dimensional Spaces,” Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, 187–196.
CARR, A., SNOEYINK, J., and AXEN, U. (2003), “Computing Contour Trees in All Dimensions,” Computational Geometry, 24, 75–94.
DRESS, A., MOULTON, V., STEEL, M., and WU, T. (2010), “Species, Clusters and the ‘Tree of life’: A Graph-Theoretic Perspective,” Journal of Theoretical Biology, 265, 535–542.
HOLLY, J. (2001), “Pictures of Ultrametric Spaces, the p-adic Numbers, and Valued Fields,” American Mathematical Monthly, 108, 721–728.
KAHN, A. (1962), “Topological Sorting of Large Networks,” Communications of the ACM, 5, 558–562.
KORNET, D.J. (1993), “Permanent Splits as Speciation Events: A Formal Reconstruction of the Internodal Species Concept,” Journal of Theoretical Biology, 164, 407–435.
KORNET,D.J.,METZ, J., and SCHELLINX, H. (1995), “Internodons as Equivalence Classes in Genealogical Networks: Building-Blocks for a Rigorous Species Concept,” Journal of Mathematical Biology, 34, 110–122.
WILLSON, J. (2011), “Restricted Trees: Simplifying Networks with Bottlenecks,” Bulletin of Mathematical Biology, 73, 2322–2338.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Alexander, S.A. Contours and Tight Clusters. J Classif 33, 103–117 (2016). https://doi.org/10.1007/s00357-016-9194-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00357-016-9194-6