Networks with small stretch number
type: Item
instance of: scholarly article
title: Networks with small stretch number
zbMATH Open document ID: 1118.68583
author: Serafino Cicerone
author: Gabriele Di Stefano
published in: Journal of Discrete Algorithms
publication date: 2007-04-26T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 5147100
zbMATH Keywords: graph class characterization
zbMATH Keywords: recognition problem
zbMATH Keywords: stretch number
zbMATH Keywords: distance-hereditary graphs
zbMATH Keywords: hierarchy of graph classes
MaRDI profile type: Publication
full work available at URL: j.jda.2004.04.002
OpenAlex ID: W2001702651
cites work: Distance-hereditary graphs
cites work: Graph Classes: A Survey
cites work: A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
cites work: Fault-Tolerant Meshes with Small Degree
cites work: Graph classes between parity and distance-hereditary graphs
cites work: Compact-port routing models and applications to distance-hereditary graphs
cites work: Q4232787
cites work: Q2766673
cites work: Q4511227
cites work: Decomposition of Directed Graphs
cites work: Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
cites work: Dominating cliques in distance-hereditary graphs
cites work: Q4693383
cites work: A Graph Model for Fault-Tolerant Computing Systems
cites work: Completely separable graphs
cites work: Q5572939
cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
cites work: On the Fault Tolerance of Some Popular Bounded-Degree Networks
cites work: Graph spanners
cites work: Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs
DOI: 10.1016/J.JDA.2004.04.002
description: scientific article; zbMATH DE number 5147100