scientific article; zbMATH DE number 140481
From MaRDI portal
Publication:4028899
zbMATH Open0767.68020MaRDI QIDQ4028899FDOQ4028899
Authors: Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
Publication date: 28 March 1993
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Cited In (7)
- Dynamic reachability in planar digraphs with one source and one sink
- Cross-series-parallel digraphs
- Speeding up dynamic transitive closure for bounded degree graphs
- Race detection and reachability in nearly series-parallel DAGs
- Amortized efficiency of a path retrieval data structure
- Dynamic expression trees
- Fully Dynamic Transitive Closure in plane dags with one source and one sink
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 Q4028899)