Incremental topological sort and cycle detection in [Equation] expected total time
SODA(2018)
摘要
In the incremental cycle detection problem edges are inserted to a directed graph (initially empty) and the algorithm has to report once a directed cycle is formed in the graph. A closely related problem to the incremental cycle detection is that of the incremental topological sort problem, in which edges are inserted to an acyclic graph and the algorithm has to maintain a valid topological sort on the vertices at all times.
Both incremental cycle detection and incremental topological sort have a long history. The state of the art is a recent breakthrough of Bender, Fineman, Gilbert and Tarjan [TALG 2016], with two different algorithms with respective total update times of Õ(n2) and O(m · min{m1/2, n2/3}). The two algorithms work for both incremental cycle detection and incremental topological sort.
In this paper we introduce a novel technique that allows us to improve upon the state of the art for a wide range of graph sparsity. Our algorithms has a total expected update time of [Equation] for both the incremental cycle detection and the topological sort problems.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络