scientific article; zbMATH DE number 140481

MaRDI QIDQ4028899zbMATH OpenFDO

Authors Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni

Publication date 28 March 1993

zbMATH Keywords

series parallel digraphsdynamic maintenance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Recommendations

• Dynamic expression trees
• scientific article; zbMATH DE number 933173
• A uniform approach to semi-dynamic problems on digraphs
• Space efficient algorithms for directed series–parallel graphs
• On-line computation of minimal and maximal length paths

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)