760 search results - page 12 / 152 » Algorithms for finding clique-transversals of graphs |
124
Voted
ECCV
2010
Springer
15 years 9 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...
153
click to vote
ISAAC
2007
Springer
15 years 10 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...
105
click to vote
SWAT
1990
Springer
15 years 8 months 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...
135
click to vote
SODA
1990
ACM
15 years 5 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...
151
click to vote
GBRPR
2007
Springer
15 years 10 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....