Journal of Combinatorial Theory Series B
An optimal synchronizer for the hypercube
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Group action graphs and parallel architectures
SIAM Journal on Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fault tolerance in hypercube-derivative networks (preliminary version)
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Multiple-Edge-Fault Tolerance with Respect to Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Reconfiguring Arrays with Faults Part I: Worst-Case Faults
SIAM Journal on Computing
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
Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Almost distance-hereditary graphs
Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Cycles in Networks
(k, +)-distance-hereditary graphs
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We introduce the (k, l)-self-spanners graphs to model non-reliable interconnection networks. Such networks can be informally characterized as follows: if at most l edges have failed, as long as two vertices remain connected, the distance between these vertices in the faulty graph is at most k times the distance in the non-faulty graph. By fixing the values k and l (called stretch factor and fault-tolerance, respectively), we obtain specific new graph classes. We first provide characterizational, structural, and computational results for these classes. Then, we study relationships between the introduced classes and special graphs classes (distance-hereditary graphs, cographs, and chordal graphs), and common network topologies (grids, tori, hypercubes, butterflies, and cube-connected cycles) as well.