Networks with small stretch number

DOI10.1016/j.jda.2004.04.002zbMath1118.68583OpenAlexW2001702651MaRDI QIDQ876723

Gabriele Di Stefano, Serafino Cicerone

Publication date: 26 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2004.04.002

zbMATH Keywords

distance-hereditary graphsstretch numberrecognition problemgraph class characterizationhierarchy of graph classes

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Related Items (4)

Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way ⋮ Distance-hereditary digraphs ⋮ Characterizations of Graphs with Stretch Number less than 2 ⋮ Self-spanner graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completely separable graphs
• Distance-hereditary graphs
• Graph classes between parity and distance-hereditary graphs
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• Graph spanners
• Decomposition of Directed Graphs
• A Graph Model for Fault-Tolerant Computing Systems
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• On the Fault Tolerance of Some Popular Bounded-Degree Networks
• Graph Classes: A Survey
• Fault-Tolerant Meshes with Small Degree
• A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
• Dominating cliques in distance-hereditary graphs
• Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs
• Compact-port routing models and applications to distance-hereditary graphs

This page was built for publication: Networks with small stretch number