# Connectivity (graph theory)

## Papers overview

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

Highly Cited

2013

Highly Cited

2013

- SODA
- 2013

The dynamic graph connectivity problem is the following: given a graph on a fixed set of n nodes which is undergoing a sequenceâ€¦Â (More)

Is this relevant?

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

- American Control Conference
- 2008

The ability of a robot team to reconfigure itself is useful in many applications: for metamorphic robots to change shape, forâ€¦Â (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

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?

Highly Cited

2001

Highly Cited

2001

- 2001

Control of vehicle formations has emerged as a topic of significant interest to the controls community. In this paper, we mergeâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- STOC
- 2000

In this paper we present near-optimal bounds for fullydynamic graph connectivity which is the most basic nontrivial fully-dynamicâ€¦Â (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- 1979

Notation: For a graph G = (V, E), n will denote the number of vertices and m the number of edges. 1. Given a graph G = (V, Eâ€¦Â (More)

Is this relevant?