暂无分享,去创建一个
[1] Alberto Marchetti-Spaccamela,et al. Maintaining a Topological Order Under Edge Insertions , 1996, Inf. Process. Lett..
[2] Edith Cohen,et al. A Labeling Approach to Incremental Cycle Detection , 2013, ArXiv.
[3] Paul F. Dietz,et al. Two algorithms for maintaining order in a list , 1987, STOC.
[4] Amir Abboud,et al. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[5] Kun-Mao Chao,et al. A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering , 2007, Theor. Comput. Sci..
[6] Robert E. Tarjan,et al. A New Approach to Incremental Cycle Detection and Related Problems , 2011, ACM Trans. Algorithms.
[7] Shiri Chechik,et al. Incremental Topological Sort and Cycle Detection in Expected Total Time , 2018, SODA.
[8] Paul H. J. Kelly,et al. A dynamic topological sort algorithm for directed acyclic graphs , 2007, ACM J. Exp. Algorithmics.
[9] Tobias Friedrich,et al. Average-case analysis of incremental topological ordering , 2010, Discret. Appl. Math..
[10] Hans L. Bodlaender,et al. Online topological ordering , 2005, SODA '05.
[11] Robert E. Tarjan,et al. Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance , 2011, ACM Trans. Algorithms.
[12] Tsvi Kopelowitz,et al. Higher Lower Bounds from the 3SUM Conjecture , 2014, SODA.
[13] Michael A. Bender,et al. A new approach to incremental topological ordering , 2009, SODA.
[14] Monika Henzinger,et al. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.
[15] Robert E. Tarjan,et al. Faster Algorithms for Incremental Topological Ordering , 2008, ICALP.
[16] Ulrich Meyer,et al. An O(n2.75) algorithm for incremental topological ordering , 2008, TALG.