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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
In multi-object tracking, it is critical to explore the data associations by exploiting the temporal information from a sequence… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
2014
2014
Computing connected components of a graph lies at the core of many data mining algorithms, and is a fundamental subroutine in… (More)
  • figure 1
  • figure 2
  • table 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the… (More)
  • table 1
  • figure 1
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We study the structure of the social graph of active Facebook users, the largest social network ever analyzed. We compute… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant… (More)
  • table 1
  • figure 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Consider the moduli space of pairs (C, ω) where C is a smooth compact complex curve of a given genus and ω is a holomorphic 1… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We consider a family of random graphs with a given expected degree sequence. Each edge is chosen independently with probability… (More)
  • figure 2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Michael T. GoodrichjS Edward F. Grovefll Roberto Tamassia*t Darren Erik Vengrofftt Jeffrey Scott Vitterqt We present a collection… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
  • Hillel Gazit
  • 27th Annual Symposium on Foundations of Computer…
  • 1986
We present a parallel randomized algorithm for finding the connected components of an undirected graph. Our algorithm takes T = O… (More)
Is this relevant?
Highly Cited
1979
Highly Cited
1979
We present a parallel algorithm which uses <italic>n</italic><supscrpt>2</supscrpt> processors to find the connected components… (More)
Is this relevant?