Computer Networks | Sciweavers

37

NETWORKS
2002

134views Computer Networks» more NETWORKS 2002»

Node-disjoint paths and related problems on hierarchical cubic networks

13 years 11 months ago

An n-dimensional hierarchical cubic network (denoted by HCN(n)) contains 2 n n-dimensional hypercubes. The diameter of the HCN(n), which is equal to n+(n+1)/3+1, is about two-thir...

Jung-Sheng Fu, Gen-Huey Chen, Dyi-Rong Duh

claim paper

Read More »

43

click to vote

NETWORKS
2002

186views Computer Networks» more NETWORKS 2002»

Approximation algorithms for constructing wavelength routing networks

13 years 11 months ago

Download pluto.huji.ac.il

Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...

Refael Hassin, Asaf Levin

claim paper

Read More »

27

click to vote

NETWORKS
2002

66views Computer Networks» more NETWORKS 2002»

Partial line directed hypergraphs

13 years 11 months ago

Download uweb.txstate.edu

Daniela Ferrero, Carles Padró

claim paper

Read More »

24

click to vote

NETWORKS
2002

71views Computer Networks» more NETWORKS 2002»

Degree- and time-constrained broadcast networks

13 years 11 months ago

Download www.cs.auckland.ac.nz

Michael J. Dinneen, Geoffrey Pritchard, Mark C. Wi...

claim paper

Read More »

37

click to vote

NETWORKS
2002

80views Computer Networks» more NETWORKS 2002»

Isomorphisms of the De Bruijn digraph and free-space optical networks

13 years 11 months ago

Download hal.archives-ouvertes.fr

The de Bruijn digraph B(d, D) has degree d, diameter D, dD vertices and dD+1 arcs. It is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left ...

David Coudert, Afonso Ferreira, Stephane Perennes

claim paper

Read More »

24

click to vote

NETWORKS
2002

63views Computer Networks» more NETWORKS 2002»

Lazy evaluation in penniless propagation over join trees

13 years 11 months ago

Download hera.ugr.es

Andrés Cano, Serafín Moral, Antonio ...

claim paper

Read More »

35

click to vote

NETWORKS
2002

96views Computer Networks» more NETWORKS 2002»

Augmented cubes

13 years 11 months ago

Download par.cse.nsysu.edu.tw

The n-dimensional augmented cube, denoted as AQn, a variation of the hypercube, possesses some properties superior to those of the hypercube. In this paper, we show that every ver...

Sheshayya A. Choudum, V. Sunitha

claim paper

Read More »

35

click to vote

NETWORKS
2002

73views Computer Networks» more NETWORKS 2002»

Superconnected digraphs and graphs with small conditional diameters

13 years 11 months ago

Download www-ma3.upc.es

The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...

Camino Balbuena, Josep Fàbrega, Xavier Marc...

claim paper

Read More »

17

click to vote

NETWORKS
1998

62views Computer Networks» more NETWORKS 1998»

Fault-tolerant graphs for tori

13 years 11 months ago