A variation of Boolean distance

Abstract

Let P be a family of paths in a connected graph G so that there exists a uv-path in P for every choice of vertices u and v. The P-interval J_P (u, v) is the union of vertex sets of all uv-paths in P. We address the problem of maximizing |J_P (u, v)| over all vertices u and v, for various families P of paths.

Authors

* External Author