Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
Current work in object categorization discriminates
among objects that typically possess gross differences
which are readily apparent. However, many applications
require making ...
Andrew Moldenke, Asako Yamamuro, David A. Lytle, E...