684 search results - page 25 / 137 » On embedding well-separable graphs |
112
click to vote
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
105
click to vote
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as five points evenly placed on the ci...
SIAMDM
2010
14 years 4 months ago
2010
We prove that if T is a tree on n vertices with maximum degree and the edge probability p(n) satisfies: np C max{ log n, n } for some constant > 0, then with high probability...
142
click to vote
ECCV
2008
Springer
14 years 11 months ago
2008
Springer
Pedestrian detection in still image should handle the large appearance and stance variations arising from the articulated structure, various clothing of human as well as viewpoints...