Distance-Preserving Graph Contractions
From MaRDI portal
Recommendations
- Distance-Preserving Graph Contractions
- Contraction distance between isomorphism classes of graphs
- A note on distance-preserving graph sparsification
- Preliminary results on distance-preserving graphs
- On constructing regular distance-preserving graphs
- Distance-preserving subgraphs of interval graphs
- Graphs preserving total distance upon vertex removal
- Contractions in persistence and metric graphs
- Graph contractions in vector-valued metric spaces and applications
- Distance preserving mappings of Grassmann graphs
Cites work
- A Tight Lower Bound for the Steiner Point Removal Problem on Trees
- Additive graph spanners
- Approximating spanners and directed Steiner forest: upper and lower bounds
- Complexity of network synchronization
- Deterministic decremental single source shortest paths: beyond the \(O(mn)\) bound
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
- Graph Partitioning and Graph Clustering
- Graph spanners
- scientific article; zbMATH DE number 1003288 (Why is no real title available?)
- scientific article; zbMATH DE number 1182768 (Why is no real title available?)
- scientific article; zbMATH DE number 2038725 (Why is no real title available?)
- scientific article; zbMATH DE number 3258067 (Why is no real title available?)
- Linear degree extractors and the inapproximability of max clique and chromatic number
- New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners
- On sparse spanners of weighted graphs
- Steiner points in tree metrics don't (really) help
- The 4/3 additive spanner exponent is tight
Cited in
(6)
This page was built for publication: Distance-Preserving Graph Contractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993321)
