# Connectivity (graph theory)

## Papers overview

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

Highly Cited

2012

Highly Cited

2012

- IEEE Transactions on Information Theory
- 2012

The random key graph is a random graph naturally associated with the random key predistribution scheme introduced by Eschenauerâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- Proceedings of the IEEE
- 2011

In this paper, we provide a theoretical framework for controlling graph connectivity in mobile robot networks. We discussâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- IEEE Transactions on Pattern Analysis and Machineâ€¦
- 2010

Word sense disambiguation (WSD), the task of identifying the intended meanings (senses) of words in context, has been a longâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- J. ACM
- 2008

We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the spaceâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- IJCAI
- 2007

Word sense disambiguation (WSD) has been a long-standing research objective for natural language processing. In this paper we areâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- 2007 46th IEEE Conference on Decision and Control
- 2007

Coordinated motion of multiple agents raises fundamental and novel problems in control theory and robotics. In particular, inâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Electronic Colloquium on Computational Complexity
- 2004

We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the spaceâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- SIAM Review
- 2004

We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition betweenâ€¦Â (More)

Is this relevant?

2002

2002

- Combinatorica
- 2002

In this paper we describe a simple model for random graphs that have an n-fold covering map onto a fixed finite base graphâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- INFOCOM
- 2001

In recent years, wireless ad hoc networks have been a growing area of research. While there has been considerable research on theâ€¦Â (More)

Is this relevant?