Graph extraction labelling and visualization

1. A method of modeling a network relationship, the method comprising:

providing a graphical representation of the network relationship by extracting the graphical representation from an n-dimensional data set representing the network relationship using a modeling system; and

labeling the graphical representation using the modeling system based on a symbol sequence, wherein the symbol sequence comprises a super-additive number sequence or a super-multiplicative number sequence.

2. The method of claim 1 , further comprising identifying an operational direction of the network relationship.

3. The method of claim 1 , further comprising identifying one or more vertices and/or edges of the network relationship.

4. The method of claim 3 , wherein labeling the graphical representation comprises referencing each vertex of the network relationship with a unique symbol from the symbol sequence.

5. The method of claim 3 , wherein labeling the graphical representation comprises referencing each edge of the network relationship with a unique symbol derived from an invertible composite function applied on all the symbols representing a plurality of vertices from one or more source vertices of the network relationship to a destination vertex of the respective edge.

6. The method of claim 1 , wherein labeling comprises sequentially uniquely referencing origination and termination points of segments of the network relationship with a unique symbol from one or more segments to one or more hierarchically arranged segments in the network relationship.

7. The method of claim 1 , wherein labeling comprises referencing a desired segment in a set of successively connected segments of the network relationship with a set of unique symbols, wherein the set of unique symbols includes a unique symbol for each of the origination and/or termination points for the different segments in the set of successively connected segments.

8. The method of claim 1 , wherein the symbol sequence further comprises a number sequence, or a string sequence, or an alphanumeric sequence, or a sign sequence.

9. The method of claim 1 , wherein the super-additive number sequence or the super-multiplicative number sequence comprises a prime number sequence, or a Fibonacci number sequence, or a number sequence based on powers of a base number.

10. The method of claim 1 , further comprising providing one or more tools for interactively visualizing and/or analyzing the graphical representation of the network relationship based on the symbol sequence.

11. The method of claim 10 , wherein the one or more tools comprises a pruning tool to limit visualization of the network relationship based on the symbol sequence.

12. The method of claim 10 , wherein the one or more tools comprises a pruning tool to limit visualization of the network relationship based on a hierarchy based pruning of the labeled graphical representation.

13. The method of claim 10 , wherein the one or more tools comprises a compositeness tool to identify a degree of connectivity of one portion to other portions of the network relationship based on the symbol sequence.

14. The method of claim 10 , wherein the one or more tools comprises a roundness tool to identify a number of connections between two portions of the network relationship based on the symbol sequence.

15. The method of claim 10 , wherein the one or more tools comprises a opacity tool to alter opacity of different portions of the network relationship based on the symbol sequence.

16. The method of claim 10 , wherein the one or more tools comprises a color visualization tool to set one or more colors to different portions of the network relationship based on the symbol sequence.

17. The method of claim 1 , wherein the network relationship comprises a blood vessel network, or a biological neural network, or an electrical circuit network, or a power distribution network, or a wiring network, or a communication network, or a computer network, or at transportation network, or an air traffic network, or a road network, or a network of rivers and/or tributaries, or a flow network.

18. A computer readable storage media, comprising:

code adapted to provide a graphical representation of a network relationship, wherein the code adapted to provide the graphical representation of the network relationship comprises code adapted to extract the graphical representation from an n-dimensional data set representing the network relationship; and

code adapted to label the graphical representation based on a symbol sequence, wherein the symbol sequence comprises a super-additive number sequence or a super-multiplicative number sequence.

19. The computer readable storage media of claim 18 , further comprising code adapted to provide a plurality of tools for interactively visualizing and/or analyzing the graphical representation of the network relationship based on the symbol sequence.

20. A system for modeling a network relationship, the system comprising:

means for providing a graphical representation of the network relationship by extracting the graphical representation from an n-dimensional data set representing the network relationship; and

means for labeling the graphical representation based on a symbol sequence, wherein the symbol sequence comprises a super-additive number sequence or a super-multiplicative number sequence.