Show simple item record  

dc.contributor.authorMcEnnis, Daniel
dc.date.accessioned2009-08-24T23:47:16Z
dc.date.available2009-08-24T23:47:16Z
dc.date.issued2009-08-20
dc.identifier.citationMcEnnis, D. (2009). Linear-time Graph Triples Census algorithm under assumptions typical of social networks. (Working paper 06/2009). Hamilton, New Zealand: University of Waikato, Department of Computer Science.en
dc.identifier.issn1177-777X
dc.identifier.urihttps://hdl.handle.net/10289/2863
dc.description.abstractA graph triples census is a histogram of all possible sets of three vertici (called a triple) from a graph. Graph triples census have been in active use in sociology for over 50 years. The earliest paper using this approach is by Holland and Leinhardt [1]. This gives a general description of the structure of directed graphs in a fixed length vector. Since this time, this analytic tool has been widely used in social network analysis. A summary of important papers using this approach, both as end product and as a component of further analysis, are in[2].en
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherUniversity of Waikato, Department of Computer Scienceen
dc.relation.ispartofseriesComputer Science Working Papers
dc.subjectcomputer scienceen
dc.subjectGraph Triples Censusen
dc.titleLinear-time graph triples census algorithm under assumptions typical of social networksen
dc.typeJournal Articleen
uow.relation.series06/2009
pubs.elements-id53915
pubs.place-of-publicationHamilton, New Zealanden_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record