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
Spanners of Hypercube-Derived Networks
SIAM Journal on Discrete Mathematics
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Graphs with Bounded Induced Distance
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Cycles in Networks
Networks with Small Stretch Number
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
(k, +)-Distance-Hereditary Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
We introduce new classes of graphs to investigate networks that guarantee constant delays even in the case of multiple edge failures. This means the following: as long as two vertices remain connected if some edges have failed, then the distance between these vertices in the faulty graph is at most a constant factor k times the original distance. In this extended abstract, we consider the case where the number of edge failures is bounded by a constant l. These graphs are called (k, l)- self-spanners. We prove that the problem of maximizing l for a given graph when k 4 is fixed is NP-complete, whereas the dual problem of minimizing k when l is fixed is solvable in polynomial time. We show how the Cartesian product affects the self-spanner properties of the composed graph. As a consequence, several popular network topologies (like grids, tori, hypercubes, butterflies, and cube-connected cycles) are investigated with respect to their self-spanner properties.