Lower bounds for embedding graphs into graphs of smaller characteristic

DOI10.1007/3-540-36206-1_27MaRDI QIDQ4415265zbMATH OpenFDO

Authors K. V. M. Naidu, H. Ramesh

Publication date 28 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2556/25560301.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Lower bounds on the distortion of embedding finite metric spaces in graphs
• Low-Distortion Embeddings of Trees
• Algorithms – ESA 2004
• A lower bound on the distortion of embedding planar metrics into Euclidean space
• A lower bound on the distortion of embedding planar metrics into Euclidean space

Cited in

(5)

• Lower bounds on the distortion of embedding finite metric spaces in graphs
• Girth and Euclidean distortion
• Low-distortion embeddings of graphs with large girth
• Algorithms – ESA 2004
• Stochastic embeddings of graphs into trees

This page was built for publication: Lower bounds for embedding graphs into graphs of smaller characteristic

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