Sökning: id:"swepub:oai:DiVA.org:uu-27249" >
Natural cycletrees :
-
Veanes, MargusUppsala universitet,Institutionen för ADB och datalogi
(författare)
Natural cycletrees : Flexible interconnection graphs
- Artikel/kapitelEngelska1996
Förlag, utgivningsår, omfång ...
-
Elsevier BV,1996
-
printrdacarrier
Nummerbeteckningar
-
LIBRIS-ID:oai:DiVA.org:uu-27249
-
https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-27249URI
-
https://doi.org/10.1006/jpdc.1996.0023DOI
Kompletterande språkuppgifter
-
Språk:engelska
-
Sammanfattning på:engelska
Ingår i deldatabas
Klassifikation
-
Ämneskategori:ref swepub-contenttype
-
Ämneskategori:art swepub-publicationtype
Anmärkningar
-
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.
Biuppslag (personer, institutioner, konferenser, titlar ...)
-
Barklund, JonasUppsala universitet,Institutionen för ADB och datalogi
(författare)
-
Uppsala universitetInstitutionen för ADB och datalogi
(creator_code:org_t)
Sammanhörande titlar
-
Ingår i:Journal of Parallel and Distributed Computing: Elsevier BV33:1, s. 44-540743-73151096-0848
Internetlänk
Hitta via bibliotek
Till lärosätets databas