Grid spanners
From MaRDI portal
Publication:5287445
DOI10.1002/NET.3230230206zbMATH Open0777.05077OpenAlexW4248999634MaRDI QIDQ5287445FDOQ5287445
Thomas C. Shermer, Arthur L. Liestman
Publication date: 5 September 1993
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230230206
Recommendations
Extremal problems in graph theory (05C35) Combinatorial aspects of tessellation and tiling problems (05B45) Paths and cycles (05C38) Polyominoes (05B50)
Cited In (16)
- Generating sparse 2—spanners
- Edge-disjoint spanners in tori
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model
- Tree spanners in planar graphs
- Spanners of de Bruijn and Kautz graphs
- Spanners of underlying graphs of iterated line digraphs
- Lattice Spanners of Low Degree
- Graph spanners in the streaming model: An experimental study
- NP-completeness of minimum spanner problems
- Restrictions of minimum spanner problems
- Edge-disjoint spanners of complete graphs and complete digraphs
- Degree-constrained spanners for multidimensional grids
- Edge-disjoint spanners in Cartesian products of graphs
- Spanners and message distribution in networks.
- Bounds on the Spanner-Sum of Torus
- Splitting numbers of grids
This page was built for publication: Grid spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287445)
