Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide

DOI10.1145/3555806arXiv2102.11169MaRDI QIDQ6127820

Kathrin Hanauer, Monika R. Henzinger, Christian Schulz

Publication date: 14 April 2024

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.11169

zbMATH Keywords

graph algorithmsdynamic algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges

This page was built for publication: Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide