4   Artículos

 
en línea
Péter L. Erdos and Tamás Róbert Mezei    
In contemporary wireless communication networks, base stations are organized into coordinated clusters (called cells) to jointly serve the users. However, such fixed systems are plagued by the so-called cell-edge problem: near the boundaries, the interfe... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Mohamed R. Zeen El Deen, Walaa A. Aboamer and Hamed M. El-Sherbiny    
The complexity (number of spanning trees) in a finite graph G G (network) is crucial. The quantity of spanning trees is a fundamental indicator for assessing the dependability of a network. The best and most dependable network is the one with the most s... ver más
Revista: Computation    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »