Networks with small stretch number

DOI10.1016/J.JDA.2004.04.002MaRDI QIDQ876723zbMATH OpenOpenAlexFDO

Authors Serafino Cicerone, Gabriele Di Stefano

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

recognition problemdistance-hereditary graphsgraph class characterizationhierarchy of graph classesstretch number

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1696525
• Graphs with bounded induced distance
• scientific article; zbMATH DE number 1262797
• scientific article; zbMATH DE number 2044923
• Self-spanner graphs

Cites work

• scientific article; zbMATH DE number 1696525 (Why is no real title available?)
• scientific article; zbMATH DE number 1262797 (Why is no real title available?)
• scientific article; zbMATH DE number 1522931 (Why is no real title available?)
• scientific article; zbMATH DE number 205350 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• A Graph Model for Fault-Tolerant Computing Systems
• A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
• Compact-port routing models and applications to distance-hereditary graphs
• Completely separable graphs
• Decomposition of Directed Graphs
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• Distance-hereditary graphs
• Dominating cliques in distance-hereditary graphs
• Fault-Tolerant Meshes with Small Degree
• Graph Classes: A Survey
• Graph classes between parity and distance-hereditary graphs
• Graph spanners
• On the Fault Tolerance of Some Popular Bounded-Degree Networks
• Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs

Cited in

(8)

• On monophonic position sets in graphs
• Distance-hereditary digraphs
• Graphs with bounded induced distance
• scientific article; zbMATH DE number 1696525 (Why is no real title available?)
• Using split composition to extend distance-hereditary graphs in a generative way (extended abstract)
• Characterizations of graphs with stretch number less than 2
• Self-spanner graphs
• Graphs with small additive stretch number

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

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