Journal of Combinatorial Theory Series B
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
Graphs with bounded induced distance
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Survivable Networks with Bounded Delay: The Edge Failure Case
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Networks with Small Stretch Number
WG '00 Proceedings of the 26th 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
Journal of Discrete Algorithms
| Hi-index | 0.00 |
In this work we introduce, characterize, and provide algorithmic results for (k, +)-distance-hereditary graphs. These graphs can be used to model interconnection networks with desirable connectivity properties; a network modeled as a (k, +)-distance-hereditary graph 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 bounded by k plus the distance in the non-faulty graph. The class of all these graphs is denoted by DH(k, +) By varying the parameter k, classes DH(k, +) form a hierarchy that represents a parametric extension of the well-known class of distance-hereditary graphs, and include all graphs.