Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets (Q714835)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets |
scientific article; zbMATH DE number 6093047
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets |
scientific article; zbMATH DE number 6093047 |
Statements
Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets (English)
0 references
11 October 2012
0 references
maximal directed acyclic graphs
0 references
maximal DAG
0 references
feedback arc set
0 references
story arc set
0 references
0.7360556721687317
0 references
0.7127315402030945
0 references
0.7096355557441711
0 references
0.7088497281074524
0 references
0.707695722579956
0 references
