Add to ORKGAnswering connectivity queries is fundamental to fully dynamic graphs where edges and vertices are inserted and deleted frequently. Existing work proposes data structures and algorithms with worst-case guarantees. We propose a new data structure, the dynamic tree (D-tree), together with algorithms to construct and maintain it. The D-tree is the first data structure that scales to fully dynamic graphs with millions of vertices and edges and, on average, answers connectivity queries much faster than data structures with worst case guarantees
We present fully dynamic algorithms for maintaining the biconnected components in general and plane...
The fully dynamic transitive closure problem asks to maintain reachability information in a directed...
AbstractA data structure is proposed to maintain a collection of vertex-disjoint trees under a seque...
Answering connectivity queries is fundamental to fully dynamic graphs where edges and vertices are i...
Deterministic fully dynamic graph algorithms are presented for connectivity and minimum spanning for...
Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide range of applic...
We present a deterministic dynamic connectivity data structure for undirected graphs with worst case...
We consider maintaining strongly connected components (SCCs) of a directed graph subject to edge ins...
The dynamic tree problem is that of maintaining an arbitrary n-vertex for-est that changes over time...
We introduce a new dynamic data structure for maintaining the strongly connected components (SCCs) o...
We give new deterministic bounds for fully-dynamic graph connectivity. Our data structure supports u...
We introduce a new dynamic data structure for maintaining the strongly connected components (SCCs) o...
We present fully dynamic algorithms for maintaining the biconnected components in general and plane ...
Depth-first search (DFS) is a well-known graph traversal algorithm and can be performed in O ( n...
We prove lower bounds on the complexity of maintaining fully dynamic k-edge or k-vertex connectivity...
We present fully dynamic algorithms for maintaining the biconnected components in general and plane...
The fully dynamic transitive closure problem asks to maintain reachability information in a directed...
AbstractA data structure is proposed to maintain a collection of vertex-disjoint trees under a seque...
Answering connectivity queries is fundamental to fully dynamic graphs where edges and vertices are i...
Deterministic fully dynamic graph algorithms are presented for connectivity and minimum spanning for...
Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide range of applic...
We present a deterministic dynamic connectivity data structure for undirected graphs with worst case...
We consider maintaining strongly connected components (SCCs) of a directed graph subject to edge ins...
The dynamic tree problem is that of maintaining an arbitrary n-vertex for-est that changes over time...
We introduce a new dynamic data structure for maintaining the strongly connected components (SCCs) o...
We give new deterministic bounds for fully-dynamic graph connectivity. Our data structure supports u...
We introduce a new dynamic data structure for maintaining the strongly connected components (SCCs) o...
We present fully dynamic algorithms for maintaining the biconnected components in general and plane ...
Depth-first search (DFS) is a well-known graph traversal algorithm and can be performed in O ( n...
We prove lower bounds on the complexity of maintaining fully dynamic k-edge or k-vertex connectivity...
We present fully dynamic algorithms for maintaining the biconnected components in general and plane...
The fully dynamic transitive closure problem asks to maintain reachability information in a directed...
AbstractA data structure is proposed to maintain a collection of vertex-disjoint trees under a seque...