On the complexity of strongly connected components in directed hypergraphs (Q517789): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TPLib / rank | |||
Normal rank | |||
Revision as of 19:22, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of strongly connected components in directed hypergraphs |
scientific article |
Statements
On the complexity of strongly connected components in directed hypergraphs (English)
0 references
27 March 2017
0 references
directed hypergraphs
0 references
strongly connected components
0 references
minimal set problem
0 references
subset partial order
0 references
