Graph querying

Following up on the post ‘Directed graphs for Biology’, if graphs were indeed made for a variety of other subjects, graph matching could be useful to analyze common structures and repeating motifs. In class we saw how triadic closure is a pervasive motif in social networks, perhaps another analogous structure exists in foreign policy networks. To detect these structures as well as retrieve a whole bunch of other information, a graph matching language could be developed. A clear limitation to the development of such a language would be the complexity of comparisons, since it would be mapping the locations of each node in relation to every other node.