91 search results - page 15 / 19 » Routing Flow Through a Strongly Connected Graph |
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. In this paper we suggest the use of light for performing useful computations. Namely, we propose a special computational device which uses light rays for solving the Hami...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
GD
1998
Springer
13 years 11 months ago
1998
Springer
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...