SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "id:"swepub:oai:DiVA.org:uu-27249" "

Search: id:"swepub:oai:DiVA.org:uu-27249"

  • Result 1-1 of 1
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Veanes, Margus, et al. (author)
  • Natural cycletrees : Flexible interconnection graphs
  • 1996
  • In: Journal of Parallel and Distributed Computing. - : Elsevier BV. - 0743-7315 .- 1096-0848. ; 33:1, s. 44-54
  • Journal article (peer-reviewed)abstract
    • 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.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-1 of 1
Type of publication
journal article (1)
Type of content
peer-reviewed (1)
Author/Editor
Veanes, Margus (1)
Barklund, Jonas (1)
University
Uppsala University (1)
Language
English (1)
Year

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.

 
pil uppåt Close

Copy and save the link in order to return to this view