Recent advances in fully dynamic graph algorithms–a quick reference guide
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …
dynamic algorithms. However, these theoretical results have received very little attention …
Recent advances in fully dynamic graph algorithms
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …
dynamic algorithms. However, these theoretical results have received very little attention …
Dynamic trees in practice
RE Tarjan, RF Werneck - Journal of Experimental Algorithmics (JEA), 2010 - dl.acm.org
Dynamic tree data structures maintain forests that change over time through edge insertions
and deletions. Besides maintaining connectivity information in logarithmic time, they can …
and deletions. Besides maintaining connectivity information in logarithmic time, they can …
[HTML][HTML] Maintaining dynamic minimum spanning trees: An experimental study
We report our findings on an extensive empirical study on the performance of several
algorithms for maintaining minimum spanning trees in dynamic graphs. In particular, we …
algorithms for maintaining minimum spanning trees in dynamic graphs. In particular, we …
Interdiction of minimum spanning trees and other matroid bases
N Weninger, R Fukasawa - arXiv preprint arXiv:2407.14906, 2024 - arxiv.org
In the minimum spanning tree (MST) interdiction problem, we are given a graph $ G=(V, E) $
with edge weights, and want to find some $ X\subseteq E $ satisfying a knapsack constraint …
with edge weights, and want to find some $ X\subseteq E $ satisfying a knapsack constraint …
Low-Latency Sliding Window Connectivity
C Zhang, A Bonifati, T Özsu - arXiv preprint arXiv:2410.00884, 2024 - arxiv.org
Connectivity queries, which check whether vertices belong to the same connected
component, are fundamental in graph computations. Sliding window connectivity processes …
component, are fundamental in graph computations. Sliding window connectivity processes …
Incremental DFS algorithms: a theoretical and experimental study
The depth first search (DFS) tree is a fundamental data structure used for solving various
graph problems. For a given graph G=(V, E) on n vertices and m edges, a DFS tree can be …
graph problems. For a given graph G=(V, E) on n vertices and m edges, a DFS tree can be …
Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs
This paper presents an algorithm for effectively maintaining the minimum spanning tree in
dynamic weighted undirected graphs. The algorithm efficiently updates the minimum …
dynamic weighted undirected graphs. The algorithm efficiently updates the minimum …
Effective tour searching for TSP by contraction of pseudo backbone edges
We introduce a reduction technique for the well-known TSP. The basic idea of the approach
consists of transforming a TSP instance to another one with smaller size by contracting …
consists of transforming a TSP instance to another one with smaller size by contracting …
Dynamic trees in practice
RE Tarjan, RF Werneck - International Workshop on Experimental and …, 2007 - Springer
Dynamic tree data structures maintain forests that change over time through edge insertions
and deletions. Besides maintaining connectivity information in logarithmic time, they can …
and deletions. Besides maintaining connectivity information in logarithmic time, they can …