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...
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 ...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
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...
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...
Qi Song, Mingqing Chen, Junjie Bai, Milan Sonka, X...
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...
Jianghai Hu, Maria Prandini, Karl Henrik Johansson...