Correction to: VPC: Pruning connected components using vector-based path compression for Graph500

The movement along the glide path of an unmanned aerial vehicle during landing on an aircraft carrier is investigated. The implementation of this task is realized in the conditions of radio silence of the aircraft carrier. The algorithm for treatment information from an optical landing system installed on an aircraft carrier is developed. The algorithm of the color signal recognition assumes the usage of the image frame preliminary treatment method via a downsample function, that performs the decimation process, the HSV model, the Otsu’s method for calculating the binarization threshold for a halftone image, and the method of separating the connected Two-Pass components. Keywords unmanned aerial vehicle; aircraft carrier; approach; glide path; optical landing system; color signal recognition algorithm; decimation; connected components; halftone image binarization

Download Full-text

Upperbounds on the probability of finding marked connected components using quantum walks

Quantum Information Processing ◽

10.1007/s11128-020-02939-4 ◽

2021 ◽

Vol 20 (1) ◽

Author(s):

Adam Glos ◽

Nikolajs Nahimovs ◽

Konstantin Balakirev ◽

Kamil Khadiev

Keyword(s):

Quantum Walks ◽

Connected Components

Download Full-text

AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY

International Journal of Foundations of Computer Science ◽

10.1142/s0129054106004042 ◽

2006 ◽

Vol 17 (03) ◽

pp. 677-701 ◽

Cited By ~ 4

Author(s):

YUNG H. TSIN

Keyword(s):

Distributed Algorithm ◽

Computer Network ◽

Connected Components ◽

Message Complexity ◽

Edge Connectivity ◽

Worst Case ◽

Dense Networks

A distributed algorithm for finding the cut-edges and the 3-edge-connected components of an asynchronous computer network is presented. For a network with n nodes and m links, the algorithm has worst-case [Formula: see text] time and O(m + nhT) message complexity, where hT < n. The algorithm is message optimal when [Formula: see text] which includes dense networks (i.e. m ∈ Θ(n2)). The previously best known distributed algorithm has a worst-case O(n3) time and message complexity.

Download Full-text

An Optimal Distributed Algorithm for Computing Bridge-Connected Components

The Computer Journal ◽

10.1093/comjnl/40.4.200 ◽

1997 ◽

Vol 40 (4) ◽

pp. 200-207 ◽

Cited By ~ 5

Author(s):

P. Chaudhuri

Keyword(s):

Distributed Algorithm ◽

Connected Components

Download Full-text

EXTENDING RESULTS OF MORGAN AND PARKER ABOUT COMMUTING GRAPHS

Bulletin of the Australian Mathematical Society ◽

10.1017/s0004972721000332 ◽

2021 ◽

pp. 1-9

Author(s):

NICOLAS F. BEIKE ◽

RACHEL CARLETON ◽

DAVID G. COSTANZO ◽

COLIN HEATH ◽

MARK L. LEWIS ◽

...

Keyword(s):

Frobenius Group ◽

Connected Components ◽

Commuting Graph

Abstract Morgan and Parker proved that if G is a group with ${\textbf{Z}(G)} = 1$ , then the connected components of the commuting graph of G have diameter at most $10$ . Parker proved that if, in addition, G is solvable, then the commuting graph of G is disconnected if and only if G is a Frobenius group or a $2$ -Frobenius group, and if the commuting graph of G is connected, then its diameter is at most $8$ . We prove that the hypothesis $Z (G) = 1$ in these results can be replaced with $G' \cap {\textbf{Z}(G)} = 1$ . We also prove that if G is solvable and $G/{\textbf{Z}(G)}$ is either a Frobenius group or a $2$ -Frobenius group, then the commuting graph of G is disconnected.

Download Full-text