Decremental maintenance of reachability in hypergraphs and minimum models of Horn formulae (Q4370204)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1104331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decremental maintenance of reachability in hypergraphs and minimum models of Horn formulae |
scientific article; zbMATH DE number 1104331 |
Statements
5 February 1998
0 references
decremental algorithm
0 references
hypergraph
0 references
0.8023765683174133
0 references
0.7761349081993103
0 references
0.7574506998062134
0 references
0.7459467649459839
0 references
Decremental maintenance of reachability in hypergraphs and minimum models of Horn formulae (English)
0 references
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].
0 references