52 search results - page 3 / 11 » Finding the maximum and minimum elements with one lie |
ISAAC
2007
Springer
14 years 6 days ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
CVPR
1996
IEEE
13 years 10 months ago
1996
IEEE
A new boundary detection approach for shape modeling is presented. It detects the global minimum of an active contour model's energy between two end points. Initialization is ...
IEICET
2006
13 years 6 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
JDA
2006
13 years 6 months ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...