Wireless sensor networks (WSNs) are a major part of the telecommunications sector. WSN is
applied in many aspects, including surveillance battlefields, patient medical monitoring …

Algorithms and data structures developed to solve graph problems on parallel computers
are surveyed. The problems discussed relate to searching graphs and finding connected …

This paper presents an algorithm by which a process in a distributed system determines a
global state of the system during a computation. Many problems in distributed systems can …

In 1900, less than 20 percent of the world population lived in cities, in 2007, just more than
50 percent of the world population lived in cities. In 2050, it has been predicted that more …

Previous research has documented the fragmented nature of software development work.
To explain this in more detail, we analyzed software developers' day-to-day information …

The single source shortest path problem for arbitrary directed graphs with n nodes, m edges
and nonnegative edge weights can sequentially be solved using O (n· log n+ m) operations …

A family of distributed algorithms for the dynamic computation of the shortest paths in a
computer network or internet is presented, validated, and analyzed. According to these …

Distributed Algorithms for Message-Passing Systems Page 1 Michel Raynal Distributed Algorithms
for Message-Passing Systems Page 2 Distributed Algorithms for Message-Passing Systems Page …

Most applications in distributed computing center around a set of common subproblems.
Distributed Systems: An Algorithmic Approach presents the algorithmic issues and …

We present a unified approach for the dynamic computation of shortest paths in a computer
network using either distance vectors or link states. We describe a distributed algorithm that …