 About 251,000 results  books.google.com In this work addresses the complex problem associated with classical reverse path forwarding, and proposes an algorithm to reduce the duplicate packets generated when broadcasting in wide area networks. 

 books.google.com 3.4 Observation 2: In theorem 1 if the we consider the path to the farthest node
then the sum of the reductions is equal to the pseudo diameter, i.e. r1+r2+ r3 ........
... rn = τ.□ 3.5 Theorem 1: If r1, r2 , r3 ........... rn are the reductions done on
pseudo ... 

 books.google.com In this work, the author proposed a practical approach for broadcasting in wide area networks. 

 books.google.com As a benchmark, we studied a completely hydrogenpassivated 3layer thick
hexagonal SiNW, which has four {111} and two (100) facets, and is shown in Fig.
8.5. The pseudodiameter of the single crystalline SiNW (before passivation) was
... 

 books.google.com In this work the effect of change in the piggybacked information on the total number of information packets generated and the bandwidth utilization when broadcasting in wide area networks, using the concept of pseudodiameter based pruning ... 

 books.google.com The criterion for choosing a starting node can be either the node with lowest
connectivity (CM method) or the endpoint of a pseudo diameter (GPS method).
With evenly distributed nodes, generally speaking the node with lowest
connectivity ... 

 books.google.com Assume ' cluster diameter ... The antipole clustering of bounded diameter 0 [64] is
perfor a topdown procedure starting from a given finite set of ... 1The pseudo—
diameter in such a case is a pair of biosequences, the €I1( different enough. 

 books.google.com This work gives an introduction to the existing broadcasting schemes that are applied for wide area networks, on the basis of which a new approach has been proposed that could be proven much more efficient for broadcasting in wide area ... 

 books.google.com ... the distance “gets stabilized”. The algorithm terminates with vertices u and v of
a “pseudodiameter” of G. For this “pseudodiameter”, a level structure [V1,...,V;,]
where u 6 V1 and v 6 V1, is then constructed in a rather complicated mannerl. 

 books.google.com Let D„ ,„ be (he diameter of a connected undirected graph on n 's* 2 vertices and
л — I =s m s s(n ) edges, where .v(;i ) ... for the determination of diameter and "
pseudodiameter" of random graphs [5] made it clear that the diameter of "most" ... 

 