4) Wash the hubs.

It starts with the global hubs.

Transportation hubs are prepped and set.

Western and Central hubs are ours.

These are the hubs of social networks.

These sites are known hubs for al Qaeda communication.

Then a label of a vertex is a set of vertices which we call hubs and distances to the hubs from the vertex.

No, for each vertex you have a set of hubs.

As we see the spread of it, we see national hubs emerging.

The sum of results, so all the hubs' shortest path distance is stored?

You can see the hubs, like who are the leaders in the group.

A TV channel, and most important hubs of co creators forming around the world.

Remember the 40 dots on the nighttime map that show the hubs of the global economy?

East Asia today has more of those global hubs than any other region in the world.

It uploaded itself from one of the main T3 hubs that carry all global internet traffic.

The South and West became agricultural hubs, and in other parts of the country, suburbs took over farmland.

It fits exactly where we need to fit it, right in the center of the hubs of the ducts in the system very critical.

What a label is is a list of other nodes in a network that he called hubs along with the distance to that hub.

If you take any 2 vertices, the set of hubs has to intersect, and the intersection mark contains a vertex on the shortest path between them.

With the trains coming in to urban hubs, they can carry pollen with them, very light pollen, and it's just a big supermarket in the city.

Right, so this is a fairly strong property, so the easiest way to do it is you say, okay, for each vertex all other vertices are at hubs.

So its about spontaneous mobilisation of a community that already exists through the multiples nodes and hubs that you have as you leave your footprints on the web.

And why it's important is that for this vertex if you sum up the distances to the 2 hubs, which you have, you will get the shortest path distance.

If you think about that if you sort these hubs by node ID we have 2 arrays, and you just need to intersect these 2 arrays of size 70, which you can do like a merge sort that is very good locality.

How many hubs do we need to list in the labels of each of the nodes in a star network so that we can make sure that we satisfy this property that we can compute the shortest path length sufficiently, specifically because for any pair of nodes in the network their labels will have some hub in common.

The hubs are chosen for each node, the labels are chosen for each node, so that they have the property that for any two nodes in the network, any two nodes where you want to compute a shortest path length between them, will have some hub in common in their labels that is on the shortest path between those nodes.