Connectivity (graph theory)

Known as: Connected (Graph Theory), Strongly-connected digraph, Disconnected graph 
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)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
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
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
In this paper, we provide a theoretical framework for controlling graph connectivity in mobile robot networks. We discuss… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Word sense disambiguation (WSD), the task of identifying the intended meanings (senses) of words in context, has been a long… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The ability of a robot team to reconfigure itself is useful in many applications: for metamorphic robots to change shape, for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Word sense disambiguation (WSD) has been a long-standing research objective for natural language processing. In this paper we are… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition between… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Control of vehicle formations has emerged as a topic of significant interest to the controls community. In this paper, we merge… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In this paper we present near-optimal bounds for fullydynamic graph connectivity which is the most basic nontrivial fully-dynamic… (More)
  • figure 1
Is this relevant?
Highly Cited
1979
Highly Cited
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?