A linear systolic algorithm for the connected component problem

1989 ◽  
Vol 29 (2) ◽  
pp. 217-226 ◽  
Author(s):  
Shing-Tsaan Huang ◽  
Ming-Shin Tsai
Keyword(s):  
Connected Component ◽  
Component Problem ◽  
Systolic Algorithm

VLSI Algorithms for the Connected Component Problem

1983 ◽  
Vol 12 (2) ◽  
pp. 354-365 ◽  
Author(s):  
Susanne E. Hambrusch
Keyword(s):  
Connected Component ◽  
Component Problem

DESIGNING A SYSTOLIC ALGORITHM FOR GENERATING WELL-FORMED PARENTHESIS STRINGS

2004 ◽  
Vol 14 (01) ◽  
pp. 83-97
Author(s):  
JONG-CHUANG TSAY
Keyword(s):  
Linear Array ◽  
Vlsi Implementation ◽  
Processor Array ◽  
Lexicographical Order ◽  
Systolic Algorithm ◽  
Left And Right ◽  
Local Connection

A parenthesis string is a string of left and right parentheses. The string is well-formed when it consists of balanced pairs of left and right parentheses. This study presents a novel systolic algorithm for generating all the well-formed parenthesis strings in lexicographical order. The algorithm is cost-optimal and is run on a linear array of processors such that each well-formed parenthesis string can be generated in three time steps. The processor array is appropriate for VLSI implementation, since it has the features of modularity, regularity, and local connection.

scholarly journals Non Kählerian surfaces with a cycle of rational curves

2021 ◽  
Vol 8 (1) ◽  
pp. 208-222
Author(s):  
Georges Dloussky
Keyword(s):  
Deformation Theory ◽  
Complex Surface ◽  
Rational Curves ◽  
Intersection Form ◽  
Connected Component ◽  
Hirzebruch Surface ◽  
Compact Complex Surface ◽  
A Chain

Abstract Let S be a compact complex surface in class VII0 + containing a cycle of rational curves C = ∑Dj . Let D = C + A be the maximal connected divisor containing C. If there is another connected component of curves C ′ then C ′ is a cycle of rational curves, A = 0 and S is a Inoue-Hirzebruch surface. If there is only one connected component D then each connected component Ai of A is a chain of rational curves which intersects a curve Dj of the cycle and for each curve Dj of the cycle there at most one chain which meets Dj . In other words, we do not prove the existence of curves other those of the cycle C, but if some other curves exist the maximal divisor looks like the maximal divisor of a Kato surface with perhaps missing curves. The proof of this topological result is an application of Donaldson theorem on trivialization of the intersection form and of deformation theory. We apply this result to show that a twisted logarithmic 1-form has a trivial vanishing divisor.

scholarly journals Robustness of Multi-Robot Systems Controlling the Size of the Connected Component After Robot Failure

2020 ◽  
Vol 53 (2) ◽  
pp. 3137-3143
Author(s):  
Toru Murayama ◽  
Lorenzo Sabattini
Keyword(s):  
Connected Component ◽  
Robot Systems ◽  
Multi Robot
Sign in / Sign up

Export Citation Format

Share Document