Packing feedback arc sets in reducible flow graphs (Q326500)
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 6637644
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing feedback arc sets in reducible flow graphs |
scientific article; zbMATH DE number 6637644 |
Statements
Packing feedback arc sets in reducible flow graphs (English)
0 references
12 October 2016
0 references
min-max relation
0 references
feedback arc set
0 references
packing
0 references
reducible flow graph
0 references
algorithm
0 references
0.8794273734092712
0 references
0.8578268885612488
0 references
0.8397356867790222
0 references
0.837337851524353
0 references
0.7998572587966919
0 references
