Results 241 to 250 of about 62,130 (264)
Some of the next articles are maybe not open access.
Batch dynamic algorithms for two graph problems
1994We provide a new paradigm to treat insertion and deletion of a batch of edges in a graph, that makes use of the sparsification technique developed for on-line algorithms. In particular, we refer to the problems of minimal spanning forest (MSF), connected components (CC) and k-vertex-connectivity (k-VC).
FERRAGINA, PAOLO, LUCCIO, FABRIZIO
openaire +2 more sources
Graph Algorithms for Dynamical Systems
2006This article is concerned with the numerical analysis of dynamical systems using methods that are based on a discretized description of the system as a graph. The graph-based description provides a unifying framework to approach a wide and diverse variety of dynamical systems, from time-discrete maps via ordinary differential equations to stochastic ...
Michael Dellnitz +4 more
openaire +1 more source
Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide
Journal of Experimental Algorithmics, 2022Christian Schulz +2 more
exaly
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
2009We present a fully dynamic graph algorithm to recognize proper interval graphs that runs in O (logn ) worst case time per edge update, where n is the number of vertices in the graph. The algorithm also maintains the connected components and supports connectivity queries in O (logn ) time.
openaire +1 more source
Sublinear update time randomized algorithms for dynamic graph regression
Applied Mathematics and Computation, 2021Mostafa Haghir Chehreghani
exaly
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Journal of the ACM, 1999Monika Henzinger, Valerie KING
exaly