Skip to search formSkip to main contentSkip to account menu

Connected component (graph theory)

Known as: Component (graph theory), Connected component, Component graph 
In graph theory, a connected component (or just component) of an undirected graph is a subgraph in which any two vertices are connected to each other… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Ackermann functionAmortized analysisBicircular matroidBiconnected component

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Cascading Failure Tolerance of Modular Small-World Networks
Many real-world networks have a modular structure, and their component may undergo random errors and/or intentional attacks. More… 
Highly Cited
2010
Highly Cited
2010
Human gait recognition using topological information
This paper shows an image/video application using topological invariants in human gait recognition. The 3D volume of a gait cycle… 
Highly Cited
2008
Highly Cited
2008
Optimised single pass connected components analysis
Classical connected components labelling algorithms are unsuitable for real-time processing of streamed images on an FPGA because… 
2007
2007
Improved algorithms for weakly chordal graphs
We use a new structural theorem on the presence of two-pairs in weakly chordal graphs to develop improved algorithms. For the… 
Highly Cited
2004
Highly Cited
2004
Set-Theoretical Algebraic Approaches to Connectivity in Continuous or Digital Spaces
Connectivity has been defined in the framework of topological spaces, but also in graphs; the two types of definitions do not… 
Highly Cited
2001
Highly Cited
2001
Error-resilient coding of 3-D graphic models via adaptive mesh segmentation
Current coding techniques for 3-D graphic models mainly focus on coding efficiency, which makes them extremely sensitive to… 
Highly Cited
2001
Highly Cited
2001
Text extraction from gray scale document images using edge information
  • Q. YuanC. Tan
  • Proceedings of Sixth International Conference on…
  • 2001
  • Corpus ID: 5240208
In this paper we present a well designed method that makes use of edge information to extract textual blocks from gray scale… 
Highly Cited
1994
Highly Cited
1994
3D morphological segmentation and motion estimation for image sequences
Highly Cited
1992
Highly Cited
1992
Postal address block location in real time
The CEDAR real-time address block location system, which determines candidates for the location of the destination address from a… 
Highly Cited
1990
Highly Cited
1990
One-pass encoding of connected components in multivalued images
A method of representing connected components in multivalued images is proposed, and an efficient, sequential, one-pass algorithm… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)