Partitioning the hypercube Qn into n isomorphic edge-disjoint trees

Simple item page
dc.contributor.authorWagner, Stephan
dc.contributor.authorWild, Marcel
dc.date.accessioned2011-08-17T07:07:09Z
dc.date.available2011-08-17T07:07:09Z
dc.date.issued2011
dc.descriptionThe original publication is available at http://www.math.tugraz.at/~wagner/Hypercube.pdfen_ZA
dc.description.abstractENGLISH 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.en_ZA
dc.description.versionPreprinten_ZA
dc.format.extent8 p.
dc.identifier.urihttp://hdl.handle.net/10019.1/16108
dc.language.isoen_ZAen_ZA
dc.publisherTU Graz University of Technologyen_ZA
dc.rights.holderTU Graz University of Technologyen_ZA
dc.subjectEdge-disjoint treesen_ZA
dc.subjectHypercubesen_ZA
dc.subjectMathematicsen_ZA
dc.titlePartitioning the hypercube Qn into n isomorphic edge-disjoint treesen_ZA
dc.typeArticleen_ZA
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
wagner_partitioning_2011.pdf
Size:
75.93 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Research Articles (Mathematical Sciences)