A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...
Daniel R. Tuohy, Walter D. Potter, Darren A. Casel...
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
David F. Gleich, Paul G. Constantine, Abraham D. F...