We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
—Flow statistics is a basic task of passive measurement and has been widely used to characterize the state of the network. Adaptive Non-Linear Sampling (ANLS)is one of the most a...
Metal binding is important for the structural and functional characterization of proteins. Previous prediction efforts have only focused on bonding state, i.e. deciding which prot...
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...