工程化全动态精确 $\Delta$-定向算法
Engineering Fully Dynamic Exact $Δ$-Orientation Algorithms
AI总结:
本文提出首个全动态精确 $\Delta$-定向算法,在边插入和删除时维护最优定向,实验显示比近似算法快32%,比静态精确算法快达6个数量级。
摘要:
(全)动态图算法是一种支持边插入、边删除并回答与所处理问题相关的特定查询的数据结构。在本工作中,我们研究全动态边定向问题,也称为全动态 $\Delta$-定向问题。其目标是维护无向图中边的定向,使得任意顶点的出度保持较低。当插入或删除边时,可能需要重新定向某些边,以防止顶点具有过高的出度。在本文中,我们提出了第一个在插入和删除期间都维护最优边定向的算法。在与近期近似精确算法的对比实验中,我们的运行时间降低了32%。我们的算法更新速度比静态精确算法快达6个数量级。
英文摘要:
A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers specific queries pertinent to the problem at hand. In this work, we address the fully dynamic edge orientation problem, also known as the fully dynamic $Δ$-orientation problem. The objective is to maintain an orientation of the edges in an undirected graph such that the out-degree of any vertex remains low. When edges are inserted or deleted, it may be necessary to reorient some edges to prevent vertices from having excessively high out-degrees. In this paper, we introduce the first algorithm that maintains an optimal edge orientation during both insertions and deletions. In experiments comparing with recent nearly exact algorithms, we achieve a 32% lower running time. The update time of our algorithm is up to 6 orders of magnitude faster than static exact algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。