International Business Machines Corporation
Adaptive labeling of network graphs

Abstract:

For each vertex of a network graph that includes a set of vertices, a meta-property of the vertex is determined relative to other vertices of the set of vertices, a distance of the vertex from a user's viewpoint of a three-dimensional (3D) rendering of the network graph is determined, and a ranking figure is calculated as a function of the determined meta-property in combination with the determined distance. The set of vertices of the network graph is ranked as a function of the respective calculated ranking figures. Labels for a subset of the set of vertices are selectively displayed on a display as a function of the ranking.