2 papers
cs.DM2008
Expanders via Random Spanning Trees
Navin Goyal, Luis Rademacher, Santosh Vempala
Motivated by the problem of routing reliably and scalably in a graph, we introduce the notion of a splicer, the union of spanning trees of a graph. We prove that for any bounded-de…
cs.CV2005
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
Vicky Choi, Navin Goyal
Point pattern matching problems are of fundamental importance in various areas including computer vision and structural bioinformatics. In this paper, we study one of the more gene…