Journal of Combinatorial Theory Series B
The Computer Journal
Distance-hereditary graphs, Steiner trees, and connected domination
SIAM Journal on Computing
Discrete Applied Mathematics - Computational combinatiorics
Fault-Tolerant Meshes with Small Degree
SIAM Journal on Computing
On the Fault Tolerance of Some Popular Bounded-Degree Networks
SIAM Journal on Computing
Graph classes: a survey
Dominating Cliques in Distance-Hereditary Graphs
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs
Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
Survivable Networks with Bounded Delay: The Edge Failure Case
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Graphs with Bounded Induced Distance
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
A Graph Model for Fault-Tolerant Computing Systems
IEEE Transactions on Computers
(k, +)-Distance-Hereditary Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
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. In this paper we give new characterization, algorithmic, and existence results about graphs with small stretch number.