171 search results - page 24 / 35 » Algorithms for Single-Source Vertex Connectivity |
166
Voted
CVPR
2009
IEEE
2009
IEEE
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
16 years 10 months ago
This paper studies a framework for matching an unknown
number of corresponding structures in two images
(shapes), motivated by detecting objects in cluttered background
and lear...
127
Voted
SGP
2003
15 years 4 months ago
2003
We present a new remeshing scheme based on the idea of improving mesh quality by a series of local modifications of the mesh geometry and connectivity. Our contribution to the fa...
142
Voted
CG
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents an intuitive, freehand sketching application for Computer Aided Design (CAD) that can reconstruct a 3D object from a single, flat, freehand sketch. A pen is us...
120
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
106
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...