Speeding up dynamic transitive closure for bounded degree graphs

Making data structures persistent

James R. Driscoll, Neil Sarnak, Daniel D. Sleator et al. · 1986 · 704 citations

Computing, Computer Science, Algorithms +8

Making data structures persistent

James R. Driscoll, Neil Sarnak, Daniel D. Sleator et al. · Journal of Computer and System Sciences · 1989 · 427 citations

Computing, Computer Science, Algorithms +8

Amortized efficiency of a path retrieval data structure

Giuseppe F. Italiano · Theoretical Computer Science · 1986 · 112 citations

Computing, Computer Science, Computer Systems +14

Finding paths and deleting edges in directed acyclic graphs

Giuseppe F. Italiano · Information Processing Letters · 1988 · 106 citations

Computing, Computer Science, Algorithms +10

INC

Daniel M. Yellin, Robert E. Strom · ACM Transactions on Programming Languages and Systems · 1991 · 77 citations · Full text

Computing, Computer Science, Algorithms +13