scientific article
From MaRDI portal
Publication:3138876
zbMath0800.68626MaRDI QIDQ3138876
F. Kenneth Zadeck, Barry K. Rosen, Roger Hoover, Peter F. Sweeney, Bowen Alpern
Publication date: 19 September 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
Related Items (14)
On competitive on-line algorithms for the dynamic priority-ordering problem ⋮ Fully dynamic biconnectivity in graphs ⋮ Dynamic expression trees ⋮ Lower bounds for monotonic list labeling ⋮ On the computational complexity of dynamic graph problems ⋮ A fully dynamic algorithm for distributed shortest paths. ⋮ A dynamic topological sort algorithm for directed acyclic graphs ⋮ Average-Case Analysis of Online Topological Ordering ⋮ Multiple matching of parameterized patterns ⋮ A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering ⋮ Average-case analysis of incremental topological ordering ⋮ Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs ⋮ An algorithm for online topological ordering ⋮ Maintaining longest paths incrementally
This page was built for publication:
