The solution of a specific network problem is shown to be equivalent t
o the decomposition of a certain complete symmetric digraph into edge
disjoint balanced transitive triples. Further related decomposition re
sults and conjectures are presented as well. (C) 1998 Elsevier Science
B.V. All rights reserved.