3008 search results - page 254 / 602 » Independence in connected graphs |
215
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
170
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
177
click to vote
ATAL
2005
Springer
16 years 4 days ago
2005
Springer
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
294
click to vote
ICITS
2011
14 years 10 months ago
2011
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
160
click to vote
IJON
2006
15 years 6 months ago
2006
This paper studies new spike-based models for winner-take-all computation and coincidence detection. In both cases, very fast convergence is achieved independent of initial condit...