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

Q2 Mathematics Journal of Experimental Algorithmics Pub Date : 2021-02-22 DOI:10.1145/3555806

Kathrin Hanauer, M. Henzinger, Christian Schulz

引用次数: 22

Abstract

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 from the practical perspective. Few of the algorithms are implemented and tested on real datasets, and their practical potential is far from understood. Here, we present a quick reference guide to recent engineering and theory results in the area of fully dynamic graph algorithms.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

全动态图算法的最新进展——快速参考指南

近年来，在全动态算法的设计和分析方面取得了重大进展。然而，从实践的角度来看，这些理论结果很少受到重视。很少有算法在真实数据集上实现和测试，它们的实际潜力还远未被理解。在这里，我们提供了一个快速参考指南，介绍了全动态图算法领域的最新工程和理论成果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Journal of Experimental Algorithmics Mathematics-Theoretical Computer Science

CiteScore

3.10

自引率

0.00%

发文量

期刊介绍： The ACM JEA is a high-quality, refereed, archival journal devoted to the study of discrete algorithms and data structures through a combination of experimentation and classical analysis and design techniques. It focuses on the following areas in algorithms and data structures: ■combinatorial optimization ■computational biology ■computational geometry ■graph manipulation ■graphics ■heuristics ■network design ■parallel processing ■routing and scheduling ■searching and sorting ■VLSI design

期刊最新文献

Random projections for Linear Programming: an improved retrieval phase SAT-Boosted Tabu Search for Coloring Massive Graphs An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut A constructive heuristic for the uniform capacitated vertex k-center problem Algorithms for Efficiently Computing Structural Anonymity in Complex Networks