DeepAI AI Chat
Log In Sign Up

On the computational complexity of the Steiner k-eccentricity

by   Xingfu Li, et al.
University of Ljubljana

The Steiner k-eccentricity of a vertex v of a graph G is the maximum Steiner distance over all k-subsets of V (G) which contain v. A linear time algorithm for calculating the Steiner k-eccentricity of a vertex on block graphs is presented. For general graphs, an O(n^ν(G)+1(n(G) + m(G) + k)) algorithm is designed, where ν(G) is the cyclomatic number of G. A linear algorithm for computing the Steiner 3-eccentricities of all vertices of a tree is also presented which improves the quadratic algorithm from [Discrete Appl. Math. 304 (2021) 181–195].


page 1

page 2

page 3

page 4


Optimal algorithm for computing Steiner 3-eccentricities of trees

The Steiner k-eccentricity of a vertex v of a graph G is the maximum Ste...

Eternal vertex cover number of maximal outerplanar graphs

Eternal vertex cover problem is a variant of the classical vertex cover ...

Eccentricity function in distance-hereditary graphs

A graph G = (V,E) is distance hereditary if every induced path of G is a...

Medians in median graphs in linear time

The median of a graph G is the set of all vertices x of G minimizing the...

A linear time algorithm for constructing orthogonal floor plans with minimum number of bends

Let G = (V, E) be a planar triangulated graph (PTG) having every face tr...

A linear-time algorithm and analysis of graph Relative Hausdorff distance

Graph similarity metrics serve far-ranging purposes across many domains ...

Fast and Reliable Dispersal of Crash-Prone Agents on Graphs

We study the ability of mobile agents performing simple local computatio...