169 search results - page 26 / 34 » Counting paths in digraphs |
INFOCOM
2000
IEEE
14 years 29 days ago
2000
IEEE
— Trainet, a new scheme to extend MPLS (Multi Protocol Label Switching) is presented. The scheme works much like the subway system in a large metropolitan area. Each (unidirectio...
IMCSIT
2010
13 years 6 months ago
2010
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
RV
2007
Springer
14 years 2 months ago
2007
Springer
Probabilistic correctness is another important aspect of reliable systems. A soft real-time system, for instance, exhibits probabilistic behaviors from tolerating some degrees of ...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...