6 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.DS2012★ 1 cited
Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges
Michael J. Bannister, Christopher DuBois, David Eppstein +1
We consider the problem of analyzing social network data sets in which the edges of the network have timestamps, and we wish to analyze the subgraphs formed from edges in contiguou…
cs.CG2012★ 6 cited
Force-Directed Graph Drawing Using Social Gravity and Scaling
Michael J. Bannister, David Eppstein, Michael T. Goodrich +1
Force-directed layout algorithms produce graph drawings by resolving a system of emulated physical forces. We present techniques for using social gravity as an additional force in…