On the complexity of directed intersection representation of DAGs (Q2019504)
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 7336134
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of directed intersection representation of DAGs |
scientific article; zbMATH DE number 7336134 |
Statements
On the complexity of directed intersection representation of DAGs (English)
0 references
21 April 2021
0 references
intersection number
0 references
digraphs
0 references
NP-hardness
0 references
approximation algorithms
0 references
0.87640065
0 references
0 references
0.85914123
0 references
0.85411954
0 references
0.85242474
0 references
0 references
0.85148036
0 references
0.8513256
0 references
0.8498721
0 references
