论文信息 - An O(n2.75) algorithm for online topological ordering

An O(n2.75) algorithm for online topological ordering

Abstract We present a simple algorithm which maintains the topological order of a directed acyclic graph with n nodes under an online edge insertion sequence in O ( n 2.75 ) time, independent of the number of edges m inserted. For dense DAGs, this is an improvement over the previous best result of O ( min { m 3 2 log n , m 3 2 + n 2 log n } ) Katriel and Bodlaender.

Ulrich Meyer | Tobias Friedrich | Deepak Ajwani

[1] P. Erdos,et al. On the evolution of random graphs , 1984 .

[2] Anna Pagh,et al. Uniform hashing in constant time and linear space , 2003, STOC '03.

[3] Alberto Marchetti-Spaccamela,et al. On-line Graph Algorithms for Incremental Compilation , 1993, WG.

[4] Alberto Marchetti-Spaccamela,et al. Maintaining a Topological Order Under Edge Insertions , 1996, Inf. Process. Lett..

[5] Thomas W. Reps,et al. On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem , 1994, Inf. Process. Lett..

[6] Paul H. J. Kelly,et al. A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs , 2004, WEA.

[7] Hans L. Bodlaender,et al. Online topological ordering , 2005, SODA '05.

[8] Ulrich Meyer,et al. An O(n2.75) Algorithm for Online Topological Ordering , 2006, SWAT.

[9] Yijie Han. Deterministic sorting in O(nlog log n) time and linear space , 2002, STOC '02.

[10] Chris Hankin,et al. Online cycle detection and difference propagation for pointer analysis , 2003, Proceedings Third IEEE International Workshop on Source Code Analysis and Manipulation.

[11] Bowen Alpern,et al. Incremental evaluation of computational circuits , 1990, SODA '90.

[12] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.