2463 search results - page 15 / 493 » Rankings of Directed Graphs |
SIAMDM
2008
13 years 7 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
ISBI
2004
IEEE
14 years 8 months ago
2004
IEEE
We present a general framework for image discrimination based on identifying small, localized differences between images. Our novel matching scheme is based on an alternate inform...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...
WG
2007
Springer
14 years 1 months ago
2007
Springer
STACS
2001
Springer
14 years 5 days ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...