scientific article; zbMATH DE number 1104331

MaRDI QIDQ4370204zbMATH OpenFDO

Authors Roberto Giaccio, Giorgio Ausiello, Paolo G. Franciosa, Daniele Frigioni

Publication date 5 February 1998

zbMATH Keywords

decremental algorithmhypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 2044509
• Partially dynamic maintenance of minimum weight hyperpaths
• Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
• Decremental single-source reachability in planar digraphs
• Improved deterministic algorithms for decremental reachability and strongly connected components

Cited in

(1)

• On the complexity of strongly connected components in directed hypergraphs

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 Q4370204)