Abstract We study a security game over network played between defender and k attackers . Every attacker chooses, probabilistically, node of the to damage. The probabilistically as well, connected induced subgraph $$\lambda $$ λ nodes scan clean. Each wishes maximize probability escaping her cleaning by defender...

We prove induced Ramsey theorems in which the monochromatic induced subgraph satisfies that all members of a prescribed set of its partial isomorphisms extend to automorphisms of the colored graph (without requirement of preservation of colors). We consider vertex and edge colorings, and extensions of partial isomorphisms in the set of all partial isomorphisms between singletons as considered b...

The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial representation extension problem for circle graphs, where the input consists of a graph G and a partial representation R′ giving some pre-drawn chords that represent an induced subgraph of G. The ques...

This paper introduces a new software product FuzzME. It was developed as a tool for creating fuzzy models of multiple-criteria evaluation and decision making. The type of evaluations employed in the fuzzy models fully corresponds with the paradigm of the fuzzy set theory; the evaluations express the (fuzzy) degrees of fulfillment of corresponding goals. The FuzzME software takes advantage of li...

This paper describes the various fuzzy rule based techniques for image segmentation. Fuzzy rule based segmentation techniques can incorporate the domain expert knowledge and manipulate numerical as well as linguistic data. They are also capable of drawing partial inference using fuzzy IF-THEN rules. For these reasons they have been intensively applied in medical imaging. But these rules are app...

FReBIR is a region-based image retrieval system, in which images are represented as adjacency graphs of fuzzy regions. An algorithm of fuzzy segmentation is first described. An algorithm to match subgraphs of fuzzy regions is then applied in order to retrieve images from partial queries, taking into account the image composition. Results are improved thanks to a relevance feedback which perform...

We show that every n-vertex planar graph admits a simultaneous embedding with no mapping and with fixed edges with any (n/2)-vertex planar graph. In order to achieve this result, we prove that every n-vertex plane graph has an induced outerplane subgraph containing at least n/2 vertices. Also, we show that every n-vertex planar graph and every n-vertex planar partial 3-tree admit a simultaneous...