760 search results - page 12 / 152 » Algorithms for finding clique-transversals of graphs |
ECCV
2010
Springer
14 years 1 months ago
2010
Springer
Many segmentation algorithms describe images in terms of a hierarchy of regions. Although such hierarchies can produce state of the art segmentations and have many applications, th...
ISAAC
2007
Springer
14 years 2 months 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...
SWAT
1990
Springer
14 years 20 days ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
SODA
1990
ACM
13 years 9 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
GBRPR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We introduce a new framework for feature grouping based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables....