scientific article; zbMATH DE number 432748

MaRDI QIDQ3138876zbMATH OpenFDO

Authors Bowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, F. Kenneth Zadeck

Publication date 19 September 1994

zbMATH Keywords

circuit evaluationcomputational circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Cited in

(14)

• Average-Case Analysis of Online Topological Ordering
• Lower bounds for monotonic list labeling
• Multiple matching of parameterized patterns
• On the computational complexity of dynamic graph problems
• 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

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)