The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Bounded expansion in web graphs”

The Median Problem on k-Partite Graphs

Karuvachery Pravas, Ambat Vijayakumar (2015)

Discussiones Mathematicae Graph Theory

Similarity:

In a connected graph G, the status of a vertex is the sum of the distances of that vertex to each of the other vertices in G. The subgraph induced by the vertices of minimum (maximum) status in G is called the median (anti-median) of G. The median problem of graphs is closely related to the optimization problems involving the placement of network servers, the core of the entire networks. Bipartite graphs play a significant role in designing very large interconnection networks. In this...