Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabr...
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...