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.
2020
2020
Dynamic Connectivity for Robust Applications in Rayleigh-Fading Channels
The fifth generation (5G) of mobile networks envisions ultra-reliability in wireless communications. One common approach to… 
2019
2019
Predicting Tasks from Task-fMRI Using Blind Source Separation
Signal estimation from functional magnetic resonance imaging data (fMRI) is a difficult and challenging task that involves… 
2018
2018
S94. Stability of early EEG background patterns after pediatric cardiac arrest
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… 
2012
2012
Assessment schemes for information availability in Mobile based Web Service environment
Quality of service for the emerging web services have become an extremely important in this emerging trend. These web services… 
2009
2009
On a Game Theoretical Methodology for Data Replication in Ad Hoc Networks
In this paper, a mathematical model for data object replication in ad hoc networks is formulated. The derived model is general… 
2009
2009
Risk profiles and distributed risk assessment
2008
2008
Fully Dynamic Connectivity
  • Valerie King
  • Encyclopedia of Algorithms
  • 2008
  • Corpus ID: 28796395
Design a data structure for an undirected graph with a fixed set of nodes which can process queries of the form “Are nodes i and… 
2005
2005
Synchronized architectures for adaptive systems
In this paper we demonstrate how to use action systems to specify and refine self-adaptive systems. Focusing on the special case… 
2002
2002
Pure Dominance Constraints
We present an efficient algorithm that checks the satisfiability of pure dominance constraints, which is a tree description… 
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)