TESTING EMBEDDABILITY BETWEEN METRIC SPACES

DOI10.1142/S0129054109006577zbMath1198.68297OpenAlexW2063036532MaRDI QIDQ3634184

Yuh-Dauh Lyuu, Ching-Lueh Chang, Yen-Wu Ti

Publication date: 23 June 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054109006577

zbMATH Keywords

metric spacesembeddabilityrandomized algorithmsproperty testingquery complexitygraph isomorphism

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Metric spaces, metrizability (54E35) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasi-isometric rigidity for the solvable Baumslag-Solitar groups. II
• The quasi-isometry classification of lattices in semisimple Lie groups
• On the asymptotic geometry of Abelian-by-cyclic groups
• Regular mappings between dimensions
• Computations in isometry groups of finite metric spaces
• On classification of finite metric spaces
• Testing Graph Isomorphism
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Geometry of cuts and metrics
• Metric spaces in pure and applied mathematics

This page was built for publication: TESTING EMBEDDABILITY BETWEEN METRIC SPACES