Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
NETWORKS
2002
11 years 1 months ago
Light graphs with small routing cost
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
NETWORKS
2002
11 years 1 months ago
Shortest-path network interdiction
Eitan Israeli, R. Kevin Wood
NETWORKS
2002
11 years 1 months ago
Node-disjoint paths and related problems on hierarchical cubic networks
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
NETWORKS
2002
11 years 1 months ago
Approximation algorithms for constructing wavelength routing networks
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
NETWORKS
2002
11 years 1 months ago
Partial line directed hypergraphs
Daniela Ferrero, Carles Padró
NETWORKS
2002
11 years 1 months ago
Degree- and time-constrained broadcast networks
Michael J. Dinneen, Geoffrey Pritchard, Mark C. Wi...
NETWORKS
2002
11 years 1 months ago
Isomorphisms of the De Bruijn digraph and free-space optical networks
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
NETWORKS
2002
11 years 1 months ago
Lazy evaluation in penniless propagation over join trees
Andrés Cano, Serafín Moral, Antonio ...
NETWORKS
2002
11 years 1 months ago
Augmented cubes
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
NETWORKS
2002
11 years 1 months ago
Superconnected digraphs and graphs with small conditional diameters
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...
books