A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Networks with small stretch number
2004
Journal of Discrete Algorithms
In a previous work, the authors introduced the class of graphs with bounded induced distance of order k (BID(k) for short), to model non-reliable interconnection networks. A network modeled as a graph in BID(k) can be characterized as follows: if some nodes have failed, as long as two nodes remain connected, the distance between these nodes in the faulty graph is at most k times the distance in the non-faulty graph. The smallest k such that G ∈ BID(k) is called stretch number of G. We show an
doi:10.1016/s1570-8667(04)00016-4
fatcat:ci2l7yqw3fgnvonz5m7cvw4dum