Constant time per edge is optimal on rooted tree networks
نویسندگان
چکیده
منابع مشابه
Constant Time per Edge Is Optimal in Rooted Tree Networks
We analyze how the expected packet delay in rooted tree networks is aaected by the distribution of time needed for a packet to cross an edge using stochastic comparison methods. Our result generalizes previously known results that the delay when the crossing time is exponentially distributed yields an upper bound for the expected delay when the crossing time is constant on this class of of netw...
متن کاملParallel On-Line Parsing in Constant Time per Word
Sikkel, K., Parallel on-line parsing in constant time per word, Theoretical Computer Science 120 (1993) 303-310. An on-line parser processes each word as soon as it is typed by the user, without waiting for the end of the sentence. Thus, in an interactive system, a sentence will be parsed almost immediately after the last word has been presented. The complexity of an on-line parser is determine...
متن کاملStreaming algorithm for graph spanners - single pass and constant processing time per edge
A spanner is a sparse subgraph of a given graph that preserves approximate distance between each pair of vertices. In precise words, a t-spanner of a graph G = (V,E), for any t ∈ N, is a subgraph (V,ES), ES ⊆ E such that, for any u, v ∈ V , their distance in the subgraph is at most t times their distance in the original graph. The parameter t is called the stretch associated with the t-spanner....
متن کاملConstant Time Generation of Rooted and Colored Outerplanar Graphs
An outerplanar graph is a graph that admits a planar embedding such that all vertices appear on the boundary of its outer face. Given a positive integer n and a color set C with K > 0 colors, we consider the problem of enumerating all colored and rooted outerplanar graphs with at most n vertices without repetition. We design an efficient algorithm that can generate all required graphs in consta...
متن کاملRank Functions on Rooted Tree Quivers
The free abelian group R(Q) on the set of indecomposable representations of a quiver Q, over a field K, has a ring structure where the multiplication is given by the tensor product. We show that if Q is a rooted tree (an oriented tree with a unique sink), then the ring R(Q)red is a finitely generated Z-module (here R(Q)red is the ring R(Q) modulo the ideal of all nilpotent elements). We will de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 1997
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s004460050036