Results 251 to 260 of about 2,728,736 (277)
Some of the next articles are maybe not open access.

Algebraic Investigation of Connected Components

2017
This paper characterizes connected components of both directed and undirected graphs as atomic fixpoints. As algebraic structure for our investigations we combine complete Boolean algebras with the well-known theory of Kleene Algebra with domain.
openaire   +1 more source

Analysis of Connected Components

2000
After binarisation of the grey level image and before the construction of a vector description, object (black) regions of the binary image must somehow be reduced to unit-width pixel strings. As illustrated in Chapter 2, vector representations may describe either the centre lines of object regions or their boundaries.
Sergey Ablameyko, Tony Pridmore
openaire   +1 more source

Connected Components and Dimension

2019
We shall shortly show that a non-empty compact Hausdorff space X is zero-dimensional iff X is totally disconnected. Recall that \( \mathop {\mathrm {comp}} \nolimits (x)\), the (connected) component of a point x ∈ X, is the union of all connected subspaces of X that contain x. The intersection of all clopen sets of X that contain x, denoted here by \( \
openaire   +1 more source

On finding the strongly connected components in a directed graph

Information Processing Letters, 1994
Esko Nuutila, Eljas Soisalon-Soininen
exaly  

Finding strongly connected components in distributed graphs

Journal of Parallel and Distributed Computing, 2005
Bruce Hendrickson   +2 more
exaly  

A1-connected components of schemes

Advances in Mathematics, 2015
Chetan Balwé, Amit Hogadi
exaly  

Temporally Connected Components

2023
Jason Schoeters   +3 more
openaire   +1 more source

Estimating the number of connected components in sublinear time

Information Processing Letters, 2014
Petra Berenbrink   +1 more
exaly  

A gamma-signal-regulated connected components labeling algorithm

Pattern Recognition, 2019
Danyang Zhang   +2 more
exaly  

A linear time algorithm for computing 3-edge-connected components in a multigraph

Japan Journal of Industrial and Applied Mathematics, 1992
Hiroshi Nagamochi
exaly  

Home - About - Disclaimer - Privacy