Edge disjoint graph spanners of complete graphs and complete digraphs

A spanning subgraph S=(V, E') of a connected simple graph (digraph)G=(V, E) is a f(x)-spanner if for any pair of nodes u and v, d/sub S/(u, v)/spl les/f(d/sub G/(u, v)) where d/sub G/ and d/sub S/ are the usual distance functions in graphs (digraphs) G and S, respectively. The delay of the f(x)-spanner is f(x)-x. The authors investigate the existence of multiple edge-disjoint spanners in complete graphs and complete digraphs.