146 search results - page 14 / 30 » Cyclic Leveling of Directed Graphs |
VDA
2010
13 years 11 months ago
2010
While there have been intensive efforts in developing better 3D flow visualization techniques, little attention has been paid to the design of better user interfaces and more effe...
JCT
1998
13 years 8 months ago
1998
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract— We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols y...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic ef...
WEA
2009
Springer
14 years 3 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...