Decremental maintenance of reachability in hypergraphs and minimum models of Horn formulae
From MaRDI portal
The paper presents a decremental algorithm for maintaining minimum rank hypergraphs in a directed hypergraph from a source vertex to all other vertices, under the assumption of unit hyperedge weights. For the entire collection see [Zbl 0879.00060].
Recommendations
- Directed hypergraphs: Problems, algorithmic results, and a novel decremental approach
- 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
(2)
This page was built for publication: Decremental maintenance of reachability in hypergraphs and minimum models of Horn formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4370204)