Determining connectedness from subdigraphs

An algorithm for determining connectedness of tetravalent metacirculant graphs

Coronary Segmentation from Echocardiography using Fuzzy Connectedness

In this paper we study the segmentation of coronary arteries from bidimensional echocardiography simulated images (phantoms) using Fuzzy Connectedness concepts implemented using Image Foresting Transform (IFT). This approach transforms the image into an oriented and weighted graph; therewith a graph-based algorithm can be applied to process the image segmentation. In echocardiographic scenario,...

Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights

In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of positive-weight constraints on overlapping sets of variables, and the goal is to assign values from a given domain to the variables so that the total weight of satisfied constraints is maximized. We consider this problem and its variant Max AW CSP where the weights are allowed to be both positive and n...

Detecting connectedness.

Natural visual images are typically composed of multiple objects, which need to be segregated from each other and from the background. The visual system has evolved to capture a great variety of cues that allow a meaningful segmentation of the visual input. One of these cues is connectedness. Connected image regions are likely to belong to a single visual object, whereas disconnected image regi...

On monochromatic paths and bicolored subdigraphs in arc-colored tournaments

Consider an arc-colored digraph. A set of vertices N is a kernel by monochromatic paths if all pairs of distinct vertices of N have no monochromatic directed path between them and if for every vertex v not in N there exists n ∈ N such that there is a monochromatic directed path from v to n. In this paper we prove different sufficient conditions which imply that an arc-colored tournament has a k...