Partitioning the hypercube Qn into n isomorphic edge-disjoint trees

SUNScholar Research Repository

Partitioning the hypercube Qn into n isomorphic edge-disjoint trees

Wagner, Stephan   Wild, Marcel
Date Issued: 2011

Abstract:

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.

Description:

The original publication is available at http://www.math.tugraz.at/~wagner/Hypercube.pdf
Please cite this item using this persistent URL: http://hdl.handle.net/10019.1/16108

Show full item record

Files in this item

Icon
Name: wagner_partitioni ...
Size: 75.92Kb
Format: PDF
Click here to download/view this file

This item appears in the following Collection(s)