Maintaining a Topological Order Under Edge Insertions
暂无分享,去创建一个
Alberto Marchetti-Spaccamela | Umberto Nanni | Hans Rohnert | H. Rohnert | U. Nanni | A. Marchetti-Spaccamela
[1] Kurt Mehlhorn,et al. LEDA: a platform for combinatorial and geometric computing , 1997, CACM.
[2] R. Tarjan. Amortized Computational Complexity , 1985 .
[3] Giuseppe F. Italiano,et al. Amortized Efficiency of a Path Retrieval Data Structure , 1986, Theor. Comput. Sci..
[4] Kurt Mehlhorn,et al. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness , 1984, EATCS Monographs on Theoretical Computer Science.
[5] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[6] Giuseppe F. Italiano,et al. Finding Paths and Deleting Edges in Directed Acyclic Graphs , 1988, Inf. Process. Lett..