FAQ

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

Related topics

Related topics

50 relations
Algebraic connectivityAlgebraic graph theoryApollonian networkBalinski's theorem
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Connectivity (graph theory)
Computational complexity theory
Computer science
Search algorithm
Graph (discrete mathematics)
Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Zero–One Laws for Connectivity in Random Key Graphs
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
Graph-theoretic connectivity control of mobile robot networks
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
An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation
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
2010
Highly Cited
2010
Decentralized estimation and control of graph connectivity for mobile sensor networks
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 3
  • figure 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Undirected connectivity in log-space
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
Graph Connectivity Measures for Unsupervised Word Sense Disambiguation
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
2005
Highly Cited
2005
Controlling Connectivity of Dynamic Graphs
The control of mobile networks of multiple agents raises fundamental and novel problems in controlling the structure of the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Undirected ST-connectivity in log-space
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?
2002
2002
Random Graph Coverings I: General Theory and Graph Connectivity
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
1997
Highly Cited
1997
Sparsification - a technique for speeding up dynamic graph algorithms
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?