Embedding Bounded Bandwidth Graphs into ℓ1

DOI10.1007/11786986_4MaRDI QIDQ3613746zbMATH OpenOpenAlexFDO

Authors Douglas E. Carroll, Ashish Goel, Adam Meyerson

Publication date 12 March 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11786986_4

zbMATH Keywords

bandwidth graphembedding graphsiterative embeddingtree bandwidth

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Bandwidth and low dimensional embedding
• Bandwidth and low dimensional embedding
• Metric embedding via shortest path decompositions
• Cuts, trees and \(\ell_1\)-embeddings of graphs
• scientific article; zbMATH DE number 1833416

Cited in

(6)

• Isometric embedding of Busemann surfaces into L₁
• Bandwidth and low dimensional embedding
• A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
• Embedding spanning subgraphs of small bandwidth
• Bandwidth and low dimensional embedding
• A (1+\varepsilon)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs

This page was built for publication: Embedding Bounded Bandwidth Graphs into ℓ1

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