Sciweavers

SIROCCO
2001
14 years 7 days ago
On Finding Minimum Deadly Sets for Directed Networks
Given a set S of elements in a directed network that are initially faulty, an element becomes (functionally) faulty if all its in-neighbors or all its outneighbors are (functional...
Norbert Zeh, Nicola Santoro
SIROCCO
2001
14 years 7 days ago
Efficient Condition-Based Consensus
The condition-based approach for consensus solvability (that we have introduced in a previous paper, ACM STOC'01) consists in identifying sets of input vectors for which it i...
Achour Mostéfaoui, Sergio Rajsbaum, Michel ...
SIROCCO
2001
14 years 7 days ago
Competitive Online Routing in Geometric Graphs
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
Prosenjit Bose, Pat Morin
SIROCCO
2001
14 years 7 days ago
Cycle Covering
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
Jean-Claude Bermond, Lilian Chacon, David Coudert,...
SIROCCO
2001
14 years 7 days ago
Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes
An Interval Routing Scheme (IRS) is a well-known, space efficient routing strategy for routing messages in a distributed network. In this scheme, each node of the network is assig...
Yashar Ganjali