Dynamic connectivity

In computing and graph theory, a dynamic connectivity structure is a data structure that dynamically maintains information about the connected… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We present a deterministic dynamic connectivity data structure for undirected graphs with worst case update time O (√ n(log logn… (More)
Is this relevant?
Review
2013
Review
2013
The brain must dynamically integrate, coordinate, and respond to internal and external stimuli across multiple time scales. Non… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Most statistical analyses of fMRI data assume that the nature, timing and duration of the psychological processes being studied… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2011
2011
In wireless underground sensor networks (WUSNs), due to the dynamic underground channel characteristics and the heterogeneous… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
We prove an Ω(lg Erik n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade… (More)
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Multiresolution shape representation is a very effective way to decompose surface geometry into several levels of detail… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Our study of thalamo-cortical systems suggests a new architecture for a neurocomputer that c of oscillators having different… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1997
1997
We consider Las Vegas randomized dynamic algorithms for on-line connectivity problems with deletions only. In particular, we show… (More)
Is this relevant?
1997
1997
We show that any algorithm that maintains the connected components of a digital image must take Ω(logn/ log logn) time per change… (More)
  • figure 1
  • figure 2
Is this relevant?
1994
1994
We present fully dynamic algorithms for maintaining the biconnected components in general and plane graphs and lower bounds for… (More)
  • figure 1
  • figure 2
Is this relevant?