4865 search results - page 217 / 973 » The Complexity of Graph Connectivity |
148
click to vote
COMGEO
2012
ACM
13 years 11 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
142
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
142
click to vote
IPMI
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper we propose a novel approach to define task-driven regularization constraints in deformable image registration using learned deformation priors. Our method ...
119
click to vote
ISPD
1999
ACM
15 years 8 months ago
1999
ACM
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
121
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...