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

Topic mentions per year

Topic mentions per year

1960-2018
010020030019602018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space… (More)
  • figure 1
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
2007
Highly Cited
2007
Coordinated motion of multiple agents raises fundamental and novel problems in control theory and robotics. In particular, in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
  • Omer Reingold
  • 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)
  • figure 1
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?
2002
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
In recent years, wireless ad hoc networks have been a growing area of research. While there has been considerable research on the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?