Additive graph spanners
From MaRDI portal
Publication:5289379
DOI10.1002/net.3230230417zbMath0783.68094OpenAlexW2021932455MaRDI QIDQ5289379
Thomas C. Shermer, Arthur L. Liestman
Publication date: 23 August 1993
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230230417
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (31)
Spanners of de Bruijn and Kautz graphs ⋮ Spanners of underlying graphs of iterated line digraphs ⋮ Graph spanners in the streaming model: An experimental study ⋮ Distance approximating spanning trees ⋮ Small stretch \((\alpha ,\beta )\)-spanners in the streaming model ⋮ Collective tree spanners in graphs with bounded parameters ⋮ Additive Spanners for Circle Graphs and Polygonal Graphs ⋮ Parameterized complexity of directed spanner problems ⋮ Restrictions of minimum spanner problems ⋮ Degree-constrained spanners for multidimensional grids ⋮ Collective additive tree spanners for circle graphs and polygonal graphs ⋮ A distance approximating trees ⋮ Combinatorial network abstraction by trees and distances ⋮ Parameterized Complexity of Directed Spanner Problems. ⋮ Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences ⋮ Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners ⋮ Edge-disjoint spanners in Cartesian products of graphs ⋮ Graph spanners: a tutorial review ⋮ Network flow spanners ⋮ Collective Additive Tree Spanners of Homogeneously Orderable Graphs ⋮ On 2-detour subgraphs of the hypercube ⋮ COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING ⋮ Sparsification lower bound for linear spanners in directed graphs ⋮ Edge-disjoint spanners in tori ⋮ Additive tree 2-spanners of permutation graphs ⋮ Distance-Preserving Graph Contractions ⋮ Bounded degree spanners of the hypercube ⋮ Mixed-integer programming approaches for the tree \(t^*\)-spanner problem ⋮ Distance-Preserving Graph Contractions ⋮ Edge-disjoint spanners of complete graphs and complete digraphs ⋮ Additive sparse spanners for graphs with bounded length of largest induced cycle
Cites Work
This page was built for publication: Additive graph spanners
