From graphs to DAGs: a low-complexity model and a scalable algorithm (Q6396128)
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: From graphs to DAGs: a low-complexity model and a scalable algorithm |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | From graphs to DAGs: a low-complexity model and a scalable algorithm |
preprint article from arXiv |
Statements
10 April 2022
0 references
cs.LG
0 references
math.OC
0 references
Shuyu Dong
0 references
Michèle Sebag
0 references
