In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin
Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the plane, we construct a straight line spanning tree T on P such that every segme...
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Registration is a fundamental task in image processing and quite a few registration techniques have been developed in various fields. In this paper we propose a novel graphreprese...
Bing Ma, Alfred O. Hero III, John D. Gorman, Olivi...