An algorithm for computing cutpoints in finite metric spaces

DOI10.1007/S00357-010-9055-7zbMATH Open1337.54016OpenAlexW2080171543MaRDI QIDQ263276FDOQ263276

Andreas Spillner, Andreas W. M. Dress, Jack H. Koolen, Vincent Moulton, Katharina T. Huber

Publication date: 4 April 2016

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-010-9055-7

Recommendations

• An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces
• The metric cutpoint partition problem
• Searching for realizations of finite metric spaces in tight spans
• Obtaining splits from cut sets of tight spans
• Trimming of metric spaces and the tight span

zbMATH Keywords

decompositionblockmetriccutpointrealizationtight span

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Metric spaces, metrizability (54E35)

Cites Work

• Introduction to algorithms
• Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
• The metric bridge partition problem: Partitioning of a metric space into two subspaces linked by an edge in any optimal realization
• A canonical decomposition theory for metrics on a finite set
• Simple algorithms for the on-line multidimensional dictionary and related problems
• Distance realization problems with applications to internet tomography
• A structured family of clustering and tree construction methods
• Six theorems about injective metric spaces
• An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Quelques problèmes concernant les espaces métriques non-séparables
• Geometry of cuts and metrics
• The metric cutpoint partition problem
• On optimal embeddings of metrics in graphs
• Block realizations of finite metrics and the tight-span construction. I: The embedding theorem
• Cut points in metric spaces
• Compatible decompositions and block realizations of finite metrics

Cited In (12)

• A polynomial time computable metric between points sets
• Injective optimal realizations of finite metric spaces
• The metric cutpoint partition problem
• Searching for realizations of finite metric spaces in tight spans
• Optimal realizations and the block decomposition of a finite metric space
• Distance spectra of graphs: a survey
• Algorithm 825
• Computing the blocks of a quasi-median graph
• An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces
• Recognizing and realizing cactus metrics
• Trees, tight-spans and point configurations
• Title not available (Why is that?)

This page was built for publication: An algorithm for computing cutpoints in finite metric spaces

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