We complement our study of 2-connectivity in directed graphs [7], by considering the computation of the following 2-vertex-connectivity relations: We say that two vertices v and w are 2-vertex-connected if there are two internally vertex-disjoint paths from v to w and two internally vertex-disjoint paths from w to v. We also say that v and w are vertex-resilient if the removal of any vertex dif...

Day and Tripathi [K. Day, A. Tripathi, Unidirectional star graphs, Inform. Process. Lett. 45 (1993) 123–129] proposed an assignment of directions on the star graphs and derived attractive properties for the resulting directed graphs: an important one is that they are strongly connected. In [E. Cheng, M.J. Lipman, On the Day–Tripathi orientation of the star graphs: Connectivity, Inform. Process....

Given an undirected graph G of n weighted edges, stored one edge per processor in a square mesh of n processors, we show how to determine the connected components and a minimal spanning forest in Θ( √ n) time. More generally, we show how to solve these problems in Θ(n1/d) time when the mesh is a d-dimensional cube, where the implied constants depend upon d.

This paper presents a fast algorithm for labeling connected components in binary images based on sequential local operations. A one-dimensional table, which memorizes label equivalences, is used for uniting equivalent labels successively during the operations in forward and backward raster directions. The proposed algorithm has a desirable characteristic: the execution time is directly proporti...

License plate recognition (LPR) plays a major role in this busy world, as the number of vehicles increases day by day, theft of vehicles, breaking traffic rules, entering restricted area are also increases linearly, so to block this act license plate recognition system is designed. License Plate Recognition (LPR) systems basically consist of 3 main processing steps such as: Detection of number ...