The intrinsic dimensionality of graphs

DOI10.1007/s00493-007-2183-yzbMath1164.05050OpenAlexW2611858627MaRDI QIDQ5900392

Robert Krauthgamer, James R. Lee

Publication date: 22 October 2008

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-007-2183-y

zbMATH Keywords

graphsintrinsic dimensionality

Mathematics Subject Classification ID

Metric geometry (51F99) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

On spatial conditioning of the spectrum of discrete random Schrödinger operators ⋮ Polynomial growth and asymptotic dimension ⋮ Graphs of linear growth have bounded treewidth ⋮ Shifting strategy for geometric graphs without geometry ⋮ Notes on graph product structure theory ⋮ Sublinear Separators in Intersection Graphs of Convex Shapes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Low diameter graph decompositions
• Approximating the bandwidth via volume respecting embeddings
• A note on distance approximating trees in graphs
• Lectures on analysis on metric spaces
• The geometry of graphs and some of its algorithmic applications
• Plongements lipschitziens dans ${\bbfR}\sp n$
• Distance Approximating Trees for Chordal and Dually Chordal Graphs
• Excluded minors, network decomposition, and multicommodity flow
• On the dimension of a graph
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

This page was built for publication: The intrinsic dimensionality of graphs