We describe a secure transformation of stateful connections or parts of them into stateless ones by attaching the state information to the messages. Secret-key cryptography is used...
Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
A new theoretical development is presented for handling the over-segmentation problem in partitioning-based connected openings. The definition we propose treats singletons generat...
An original binarization method based on connected operators is proposed in this paper. Connected operators enable to filter and/or segment an image by preserving its contours. T...