Skip to search formSkip to main contentSkip to account menu

Dynamic connectivity

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

Related topics

Related topics

7 relations
Connectivity (graph theory)Depth-first searchDisjoint-set data structureDynamic problem (algorithms)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
New Randomized Data Structure Lower Bounds for Dynamic Graph Connectivity
The problem of dynamic connectivity in graphs has been extensively studied in the cell probe model. The task is to design a data… 
2015
2015
A Novel Biologically Inspired Neural Network and Its Application on the Locomotion Control of Quadruped Robot
This paper proposed a novel Biologically Inspired Neural Networks-central pattern generator (CPG) model with proprioceptive and… 
2015
2015
Dynamic Connectivity for Unit Disk Graphs ∗
Let S ⊂ R be a set of point sites. The unit disk graph UD(S) of S has vertex set S and an edge between two sites s, t if and only… 
2015
2015
Deterministic Worst Case Dynamic Connectivity: Simpler and Faster
We present a deterministic dynamic connectivity data structure for undirected graphs with worst-case update time $O(\sqrt{n}/w^{1… 
2011
2011
Guest Editor's Foreword
2007
2007
Hybrid Pipeline Structure for Self-Organizing Learning Array
In recent years, many efforts have been put in applying the concept of reconfigurable computing to neural networks. In our… 
Review
2006
Review
2006
On Information Modeling for the Management of Control Plane Functionality in Transport Networks
The control plane (CP) of transport networks consists in a set of entities, communicating through a signaling network, that is… 
2001
2001
Maintaining dynamic graph properties deterministically
In this paper we present deterministic fully dynamic algorithms for maintaining several properties on undirected graphs subject… 
1994
1994
Lower Bounds for Dynamic Connectivity Problems in Graphs
We prove lower bounds on the complexity of maintaining fully dynamic $k$-edge or $k$-vertex connectivity in plane graphs and in… 
1988
1988
Heuristics for Robot System Design Using a Concurrent Hierarchical Control Model
The problem formulation of a robot control system i s dominated by the time-critical aspect. To achieve success in this time… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)