scientific article; zbMATH DE number 432748
From MaRDI portal
Publication:3138876
zbMATH Open0800.68626MaRDI QIDQ3138876FDOQ3138876
Authors: Bowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, F. Kenneth Zadeck 
Publication date: 19 September 1994
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
Cited In (14)
- Lower bounds for monotonic list labeling
- On the computational complexity of dynamic graph problems
- Multiple matching of parameterized patterns
- Fully dynamic biconnectivity in graphs
- A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering
- A fully dynamic algorithm for distributed shortest paths.
- Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs
- On competitive on-line algorithms for the dynamic priority-ordering problem
- An algorithm for online topological ordering
- Average-case analysis of incremental topological ordering
- Maintaining longest paths incrementally
- Dynamic expression trees
- A dynamic topological sort algorithm for directed acyclic graphs
- Average-Case Analysis of Online Topological Ordering
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138876)
