A generalized algorithm for centrality problems on trees

A general framework is presented for rapidly analyzing tree networks to compute a measure of the centrality or eccentricity of all vertices in the tree. Several problems, which have been previously described in the literature, fit this framework. Some of these problems have no published solution better than performing a separate traversal for each vertex whose eccentricity is calculated. The method presented in this paper performs just two traversals and yields the eccentricities of all vertices in the tree. Natural sufficient conditions for the algorithm to work in linear time on any given problem are stated.

[1]  Nicos Christofides,et al.  Graph theory: An algorithmic approach (Computer science and applied mathematics) , 1975 .

[2]  S. Hakimi,et al.  On p -Centers in Networks , 1978 .

[3]  E. Kay,et al.  Graph Theory. An Algorithmic Approach , 1975 .

[4]  Aaron Kershenbaum,et al.  Recursive analysis of network reliability , 1973, Networks.

[5]  Eugene L. Lawler,et al.  Why certain subgraph computations requite only linear time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[6]  A. J. Goldman.  Minimax Location of a Facility in a Network , 1972 .

[7]  Jacques-François Thisse,et al.  Single Facility Location on Networks , 1987 .

[8]  A. F. Adams,et al.  The Survey , 2021, Dyslexia in Higher Education.

[9]  Nobuji Saito,et al.  Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.

[10]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .

[11]  Andy N. C. Kang,et al.  Some Properties of a Centroid of a Free Tree , 1975, Inf. Process. Lett..

[12]  Timothy J. Lowe,et al.  Block-vertex duality and the one-median problem , 1985, Networks.

[13]  Stephen T. Hedetniemi,et al.  A Linear Algorithm for the Domination Number of a Tree , 1975, Inf. Process. Lett..

[14]  J. Shekel.  Optimal source location to feed a lossy distribution tree , 1973 .

[15]  A. J. Goldman.  Optimal Center Location in Simple Networks , 1971 .

[16]  S. M. Hedetniemi,et al.  Linear Algorithms for Finding the Jordan Center and Path Center of a Tree , 1981 .

[17]  Timothy J. Lowe,et al.  Location on Networks: A Survey. Part I: The p-Center and p-Median Problems , 1983 .

[18]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[19]  Peter J. Slater,et al.  R-Domination in Graphs , 1976, J. ACM.

[20]  G. Handler.  Minimax Location of a Facility in an Undirected Tree Graph , 1973 .

[21]  N. Megiddo.  Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[22]  S. Halfin.  Letter to the Editor—On Finding the Absolute and Vertex Centers of a Tree with Distances , 1974 .

[23]  Frank Harary,et al.  Graph Theory , 2016 .

[24]  Arthur M. Farley.  Vertex Centers of Trees , 1982 .

[25]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .