1963 search results - page 30 / 393 » The Maximum Solution Problem on Graphs |
107
Voted
ICPR
2000
IEEE
16 years 3 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
161
click to vote
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
118
click to vote
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
359
click to vote
IPMI
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. Multi-object segmentation with mutual interaction is a challenging task in medical image analysis. We report a novel solution to a segmentation problem, in which target o...
110
click to vote
HYBRID
2001
Springer
15 years 7 months ago
2001
Springer
In this paper we address the problem of designing energy minimizing collision-free maneuvers for multiple agents moving on a plane. We show that the problem is equivalent to that o...