On the complexity of strongly connected components in directed hypergraphs (Q517789): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C40 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C65 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6697316 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
directed hypergraphs | |||
| Property / zbMATH Keywords: directed hypergraphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
strongly connected components | |||
| Property / zbMATH Keywords: strongly connected components / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
minimal set problem | |||
| Property / zbMATH Keywords: minimal set problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
subset partial order | |||
| Property / zbMATH Keywords: subset partial order / rank | |||
Normal rank | |||
Revision as of 04:35, 1 July 2023
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
