Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
In this paper we discuss the design of optimization algorithms for cognitive wireless networks (CWNs). Maximizing the perceived network performance towards applications by selectin...
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Abstract—Detecting the occurrence and location of performance anomalies (e.g., high jitter or loss events) is critical to ensuring the effective operation of network infrastructu...
Paul Barford, Nick G. Duffield, Amos Ron, Joel Som...