Average path length

Average path length is a concept in network topology that is defined as the average number of steps along the shortest paths for all possible pairs… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Average path length (APL) is an index of small-world networks. Calculating APL accurately requires measuring all of the shortest… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
2014
2014
Small-World Network Models and Their Average Path Length Samah Taha Department of Mathematical Sciences, University of… (More)
  • figure 2.1
  • table 2.1
  • figure 2.2
  • table 2.2
  • figure 2.3
Is this relevant?
2014
2014
Define the average path length in a connected graph as the sum of the length of the shortest path between all pairs of nodes… (More)
  • figure 1
Is this relevant?
2012
2012
In this paper, we further explore into the impact of link removal from a global point of view. While diseases spread more… (More)
  • figure 1
  • figure 2
Is this relevant?
2011
2011
We study the effect of random removal of edges on the average path length (APL) in a large class of uncorrelated random networks… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
This paper deals with analytic methods for the calculation and reduction of the average path lengths (APLs) in binary decision… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2005
2005
The traditional problem in binary decision diagrams (BDDs) has been to minimize the number of nodes since this reduces the memory… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2005
2005
In a decision diagram, the average path length (APL) is the average number of nodes on a path from the root node to a terminal… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
Minimizing the Average Path Length (APL) in a BDD reduces the time needed to evaluate Boolean functions represented by BDDs. This… (More)
  • figure 2.1
  • figure 5.1
  • figure 4.1
  • table 7.1
  • table 7.2
Is this relevant?
2003
2003
We consider the path length in decision diagrams for multiple-valued functions. This is an important measure of a decision… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?