Sökning: id:"swepub:oai:DiVA.org:uu-27249" > Natural cycletrees :
Fältnamn | Indikatorer | Metadata |
---|---|---|
000 | 01902naa a2200265 4500 | |
001 | oai:DiVA.org:uu-27249 | |
003 | SwePub | |
008 | 081017s1996 | |||||||||||000 ||eng| | |
024 | 7 | a https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-272492 URI |
024 | 7 | a https://doi.org/10.1006/jpdc.1996.00232 DOI |
040 | a (SwePub)uu | |
041 | a engb eng | |
042 | 9 SwePub | |
072 | 7 | a ref2 swepub-contenttype |
072 | 7 | a art2 swepub-publicationtype |
100 | 1 | a Veanes, Margusu Uppsala universitet,Institutionen för ADB och datalogi4 aut |
245 | 1 0 | a Natural cycletrees :b Flexible interconnection graphs |
264 | 1 | b Elsevier BV,c 1996 |
338 | a print2 rdacarrier | |
520 | a Natural cycletrees, formally defined in this paper, is a subclass of Hamiltonian graphs with maximum degree 3 that contain a binary spanning tree. A natural cycletree used as an interconnection network thus supports directly broadcasting through the binary tree as well as nearest-neighbor communication through the cycle. Natural cycletrees have several other interesting properties; e.g., they are planar, easily extensible, and can be contracted using the same methods as for binary trees. The main results of the paper are: (i) Given an arbitrary basic binary spanning treeT, there exists a natural cycletree with a minimal number of edges forT. (ii) A natural cycletree has a very simple router. We give a superfast parallel algorithm that can establish near optimal router data for that router. | |
700 | 1 | a Barklund, Jonasu Uppsala universitet,Institutionen för ADB och datalogi4 aut |
710 | 2 | a Uppsala universitetb Institutionen för ADB och datalogi4 org |
773 | 0 | t Journal of Parallel and Distributed Computingd : Elsevier BVg 33:1, s. 44-54q 33:1<44-54x 0743-7315x 1096-0848 |
856 | 4 8 | u https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-27249 |
856 | 4 8 | u https://doi.org/10.1006/jpdc.1996.0023 |
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.