Routing sets in the integer lattice
type: Item
instance of: scholarly article
title: Routing sets in the integer lattice
zbMATH Open document ID: 1119.05088
author: Peter Hamburger
author: Matt Walsh
author: Robert C. Vandell
published in: Discrete Applied Mathematics
publication date: 2007-07-19T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5173154
zbMATH Keywords: connected domination
zbMATH Keywords: grid graphs
MaRDI profile type: Publication
full work available at URL: j.dam.2007.02.007
OpenAlex ID: W1980795137
cites work: Q4326192
cites work: Q4368729
cites work: Q4544029
cites work: Q3829572
cites work: Q3895508
cites work: Fault-tolerant locating-dominating sets
cites work: Q5471356
DOI: 10.1016/J.DAM.2007.02.007
Recommended article: On the general routing polytope
Recommended article: Q3210199
Recommended article: Q4944978
Recommended article: Routing by matching on convex pieces of grid graphs
Recommended article: Q3162565
Recommended article: Routing in unit disk graphs
Recommended article: Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes
Recommended article: Q5015392
Recommended article: The Compactness of Interval Routing
description: scientific article; zbMATH DE number 5173154