Routing sets in the integer lattice

DOI10.1016/J.DAM.2007.02.007zbMATH Open1119.05088OpenAlexW1980795137MaRDI QIDQ997064FDOQ997064

Authors: Peter Hamburger, Matt Walsh, Robert C. Vandell 

Publication date: 19 July 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.02.007

Recommendations

• On the general routing polytope
• Publication:3210199
• Publication:4944978
• Routing by matching on convex pieces of grid graphs
• Routing in graphs
• Routing in unit disk graphs
• Routing in unit disk graphs
• Routing numbers of cycles, complete bipartite graphs, and hypercubes
• An axiomatic approach to routing
• The Compactness of Interval Routing

zbMATH Keywords

grid graphsconnected domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fault-tolerant locating-dominating sets
• Title not available (Why is that?)

Cited In (5)

• Planar lattice subsets with minimal vertex boundary
• Routes enumeration in a Boolean with respect to intersection and nonintersection relations
• The hub number, girth and Mycielski graphs
• The hub number of co-comparability graphs
• The hub number of a graph

This page was built for publication: Routing sets in the integer lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997064)