# Connected component (graph theory)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2016

Highly Cited

2016

- IEEE Transactions on Image Processing
- 2016

In multi-object tracking, it is critical to explore the data associations by exploiting the temporal information from a sequenceâ€¦Â (More)

Is this relevant?

2014

2014

- SoCC
- 2014

Computing connected components of a graph lies at the core of many data mining algorithms, and is a fundamental subroutine inâ€¦Â (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- Journal of Machine Learning Research
- 2012

We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter Î». Suppose theâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- ArXiv
- 2011

We study the structure of the social graph of active Facebook users, the largest social network ever analyzed. We computeâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- KDD
- 2008

The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giantâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- 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)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- 2002

We consider a family of random graphs with a given expected degree sequence. Each edge is chosen independently with probabilityâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- SODA
- 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

- 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

- Commun. ACM
- 1979

We present a parallel algorithm which uses <italic>n</italic><supscrpt>2</supscrpt> processors to find the connected componentsâ€¦Â (More)

Is this relevant?