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

maximum degreemultidimensional gridsnetworkpathspanners

Mathematics Subject Classification ID

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

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

(18)

• Edge-disjoint spanners in tori
• Edge-disjoint spanners of complete graphs and complete digraphs
• NP-completeness of minimum spanner problems
• Restrictions of minimum spanner problems
• Spanners and message distribution in networks.
• Splitting numbers of grids
• Degree-constrained spanners for multidimensional grids
• Edge-disjoint spanners in Cartesian products of graphs
• Lattice spanners of low degree
• Spanners of de Bruijn and Kautz graphs
• Spanners of underlying graphs of iterated line digraphs
• Spanners of Hypercube-Derived Networks
• Generating sparse 2—spanners
• Bounds on the Spanner-Sum of Torus
• Tree spanners in planar graphs
• Constructing red-black spanners for mixed-charging vehicular networks
• Graph spanners in the streaming model: An experimental study
• Small stretch ( , )-spanners in the streaming model

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)