In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes orâ€¦Â (More)

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

Highly Cited

2012

Highly Cited

2012

- Osman Yagan, Armand M. Makowski
- 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

- Michael M. Zavlanos, Magnus Egerstedt, George J. Pappas
- 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

- Roberto Navigli, Mirella Lapata
- 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

2010

Highly Cited

2010

- Peng Yang, Randy A. Freeman, Geoffrey J. Gordon, Kevin M. Lynch, Siddhartha S. Srinivasa, Rahul Sukthankar
- Automatica
- 2010

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

2008

Highly Cited

2008

- Omer Reingold
- 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

- Roberto Navigli, Mirella Lapata
- 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

2005

Highly Cited

2005

- M. M. Zavlanos, G. J. Pappas
- Proceedings of the 44th IEEE Conference onâ€¦
- 2005

The control of mobile networks of multiple agents raises fundamental and novel problems in controlling the structure of theâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Omer Reingold
- STOC
- 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?

2002

2002

- Alon Amit, Nathan Linial
- 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

1997

Highly Cited

1997

- David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
- J. ACM
- 1997

We provide data strutures that maintain a graph as edges are inserted and deleted, and keep track of the following propertiesâ€¦Â (More)

Is this relevant?