Testing metric properties

DOI10.1016/S0890-5401(03)00160-3MaRDI QIDQ1877548zbMATH OpenOpenAlexFDO

Authors Michal Parnas, Dana Ron

Publication date 19 August 2004

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0890-5401(03)00160-3

zbMATH Keywords

decision problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Metric spaces, metrizability (54E35)

Recommendations

• Testing metric properties
• Testing Properties of Sets of Points in Metric Spaces
• Recognition of Tree Metrics
• TESTING EMBEDDABILITY BETWEEN METRIC SPACES
• Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices

Cites work

• scientific article; zbMATH DE number 1819631 (Why is no real title available?)
• scientific article; zbMATH DE number 45885 (Why is no real title available?)
• scientific article; zbMATH DE number 53860 (Why is no real title available?)
• scientific article; zbMATH DE number 2079317 (Why is no real title available?)
• scientific article; zbMATH DE number 3448387 (Why is no real title available?)
• scientific article; zbMATH DE number 1857651 (Why is no real title available?)
• scientific article; zbMATH DE number 3331438 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• A fast algorithm for constructing trees from distance matrices
• A robust model for finding optimal evolutionary tree
• Abstract Combinatorial Programs and Efficient Property Testers
• Computational complexity of inferring phylogenies from dissimilarity matrices
• Determining the Evolutionary Tree Using Experiments
• On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
• Property testing and its connection to learning and approximation
• Property testing in bounded degree graphs
• Robust Characterizations of Polynomials with Applications to Program Testing
• Testing metric properties
• Testing of Clustering
• The complexity of ultrametric partitions on graphs

Cited in

(4)

• Testing Properties of Sets of Points in Metric Spaces
• Testing metric properties
• scientific article; zbMATH DE number 6028051 (Why is no real title available?)
• Distribution-free connectivity testing for sparse graphs

This page was built for publication: Testing metric properties

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