4 search results - page 1 / 1 » A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching... |
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
CVPR
2008
IEEE
14 years 6 months ago
2008
IEEE
In this paper, the problem of estimating automatically the symmetry plane of bilateral objects (having perfect or imperfect mirror symmetry) in point clouds is reexamined. Classic...
IWOCA
2009
Springer
13 years 11 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...