Faulty random geometric networks

Parallel Processing Letters

Volumn 10, Issue 4, 2000, Pages 343-357

  Diaz, J ^a   Petit, J ^a   Serna, M ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATA COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; NETWORK PROTOCOLS; PROBABILITY; RANDOM PROCESSES;

HAMILTONIAN CYCLE; RANDOM GEOMETRIC NETWORKS; UNIT DISK GRAPH;

COMPUTER NETWORKS;

EID: 0034439902     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0129626400000329     Document Type: Article

References (17)

1. Optimal linear ordering
2. d
3. d
4. d
5. An algorithm for finding Hamilton paths and cycles in random graphs
6. Unit disk graphs
7. Approximating layout problems on random geometric graphs
8. 2
9. A survey on graph layout problems
10. Analysis of edge deletion processes on faulty random regular graphs
11. A randomized fully polynomial approximation scheme for all terminal network realiability problem
12. Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing
13. Efficient communication establishment in adverse communication environments
14. On k-connectivity for a geometric random graph