In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

SIAM Journal on Applied Mathematics, Vol. 34, No. 1 (Jan., 1978), pp. 176-197 (22 pages) We consider a graph-theoretic elimination process which models Gaussian elimination on sparse systems of linear ...

Collapsibility means that the same statistical result of interest can be obtained before and after marginalization over some variables. In this paper, we discuss three kinds of collapsibility for ...