Ask a Question

Prefer a chat interface with context about you and your work?

Convexity in graphs

Convexity in graphs

The convex hull of a set S of points of a graph G is the smallest set T containing S such that all the points in a geodesic joining two points of T lie in T. The convex hull T can also be formed by taking all geodesies joining two …