Now showing items 1-2 of 2

  • Decomposing the hypercube Qn into n isomorphic edge-disjoint trees 

    Wagner, Stephan; Wild, Marcel (Elsevier, 2012-02)
    The problem of finding edge-disjoint trees in a hypercube arises for example in the context of parallel computing [3]. Independently of applications it is of high aesthetic appeal. The hypercube of dimension n, denoted ...
  • Partitioning the hypercube Qn into n isomorphic edge-disjoint trees 

    Wagner, Stephan; Wild, Marcel (TU Graz University of Technology, 2011)
    ENGLISH ABSTRACT: The problem of finding edge-disjoint trees in a hypercube e.g. arises in the context of parallel computing. Independent of applications it is of high aesthetic appeal.