loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th International Conference of the Chilean Computer Science Society
A Technique for the (d, s, N)-Bus Network Problem
Talca, Chile
November 11-November 13
ISBN: 0-7695-0296-2
ASCII Text
x 
 
Daniela Ferrero, "A Technique for the (d, s, N)-Bus Network Problem," Chilean Computer Science Society, International Conference of the, pp. 129, 19th International Conference of the Chilean Computer Science Society, 1999.
 
 
BibTex
x
 
@article{ 10.1109/SCCC.1999.810165,
author = {Daniela Ferrero},
title = {A Technique for the (d, s, N)-Bus Network Problem},
journal ={Chilean Computer Science Society, International Conference of the},
volume = {0},
year = {1999},
issn = {1522-4902},
pages = {129},
doi = {http://doi.ieeecomputersociety.org/10.1109/SCCC.1999.810165},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Chilean Computer Science Society, International Conference of the
TI - A Technique for the (d, s, N)-Bus Network Problem
SN - 1522-4902
SP
EP
A1 - Daniela Ferrero,
PY - 1999
VL - 0
JA - Chilean Computer Science Society, International Conference of the
ER -
 
Daniela Ferrero, Universitat Polit?cnica de Catalunya
A problem in the design of bus interconnection networks is to find directed hypergraphs with minimum diameter for fixed values of the order, processors degree and bus size. In this paper we propose the partial line hyperdigraph as a technique for it. The partial line hyperdigraph is related to the line hyperdigraph [1], the partial line digraph [6] and the line digraph [7]. Partial line hyperdigraphs have also good connectivity, expandability and easy routing. Specially interesting results are obtained for the generalized Kautz hyperdigraph.
Citation:
Daniela Ferrero, "A Technique for the (d, s, N)-Bus Network Problem," sccc, pp.129, 19th International Conference of the Chilean Computer Science Society, 1999
Usage of this product signifies your acceptance of the Terms of Use.