Grid spanners

DOI10.1002/NET.3230230206MaRDI QIDQ5287445zbMATH OpenOpenAlexFDO

Authors Arthur L. Liestman, Thomas C. Shermer

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

zbMATH Keywords

networkmaximum degreepathmultidimensional gridsspanners

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of tessellation and tiling problems (05B45) Paths and cycles (05C38) Polyominoes (05B50)

Recommendations

• Degree-constrained spanners for multidimensional grids
• Spanners of Hypercube-Derived Networks
• Spanners in graphs of bounded degree
• Spanners of de Bruijn and Kautz graphs

Cited in

(17)

• Bounds on the Spanner-Sum of Torus
• Generating sparse 2—spanners
• Edge-disjoint spanners in tori
• Small stretch ( , )-spanners in the streaming model
• Spanners of de Bruijn and Kautz graphs
• Spanners of underlying graphs of iterated line digraphs
• Tree spanners in planar graphs
• Graph spanners in the streaming model: An experimental study
• Lattice spanners of low degree
• 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
• Constructing red-black spanners for mixed-charging vehicular networks
• Edge-disjoint spanners in Cartesian products of graphs
• Spanners and message distribution in networks.
• 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)