Social Networks and Subnetworks Indexing

[InfernoX5515]

We need to make our own indexing algorithm and method. This will be in the form of subnetworks that make up the entire network. Users are grouped together to form sub-networks (with constraints TBD). These sub-networks will be considered nodes in the larger whole network. If these nodes are still too big after being condensed, break the nodes into more sub-networks. This will form a tree structure that will be indexed.

There needs to be information about edges of the subgraphs (such as influence, max k, etc) recorded and a list of users in the node.

[InfernoX5515]

An actual formula is needed. We can get a score for the partitioning method and compare what is better.